{"id":"https://openalex.org/W2579912193","doi":"https://doi.org/10.1080/10556788.2017.1281924","title":"An enhanced bitstring encoding for exact maximum clique search in sparse graphs","display_name":"An enhanced bitstring encoding for exact maximum clique search in sparse graphs","publication_year":2017,"publication_date":"2017-01-30","ids":{"openalex":"https://openalex.org/W2579912193","doi":"https://doi.org/10.1080/10556788.2017.1281924","mag":"2579912193"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2017.1281924","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2017.1281924","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075752573","display_name":"Pablo San Segundo","orcid":"https://orcid.org/0000-0001-7050-5563"},"institutions":[{"id":"https://openalex.org/I4210125392","display_name":"Centre for Automation and Robotics","ror":"https://ror.org/02wh02235","country_code":"ES","type":"facility","lineage":["https://openalex.org/I134820265","https://openalex.org/I4210125392","https://openalex.org/I88060688"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"Pablo San Segundo","raw_affiliation_strings":["Center for Automation and Robotics (UPM-CSIC), Madrid, Spain"],"affiliations":[{"raw_affiliation_string":"Center for Automation and Robotics (UPM-CSIC), Madrid, Spain","institution_ids":["https://openalex.org/I4210125392"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004441215","display_name":"Jorge Artieda","orcid":null},"institutions":[{"id":"https://openalex.org/I4210125392","display_name":"Centre for Automation and Robotics","ror":"https://ror.org/02wh02235","country_code":"ES","type":"facility","lineage":["https://openalex.org/I134820265","https://openalex.org/I4210125392","https://openalex.org/I88060688"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Jorge Artieda","raw_affiliation_strings":["Center for Automation and Robotics (UPM-CSIC), Madrid, Spain"],"affiliations":[{"raw_affiliation_string":"Center for Automation and Robotics (UPM-CSIC), Madrid, Spain","institution_ids":["https://openalex.org/I4210125392"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019206200","display_name":"Mikhail Batsyn","orcid":"https://orcid.org/0000-0002-0302-2673"},"institutions":[{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Mikhail Batsyn","raw_affiliation_strings":["Laboratory of Algorithms and Technologies for Network Analysis, National Research University Higher School of Economics, Niznhy Novgorod, Russia"],"affiliations":[{"raw_affiliation_string":"Laboratory of Algorithms and Technologies for Network Analysis, National Research University Higher School of Economics, Niznhy Novgorod, Russia","institution_ids":["https://openalex.org/I118501908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050062467","display_name":"P\u00e3nos M. Pardalos","orcid":"https://orcid.org/0000-0001-9623-8053"},"institutions":[{"id":"https://openalex.org/I4210089412","display_name":"Applied Optimization (United States)","ror":"https://ror.org/004b0n253","country_code":"US","type":"company","lineage":["https://openalex.org/I4210089412"]},{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]},{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["RU","US"],"is_corresponding":false,"raw_author_name":"Panos M. Pardalos","raw_affiliation_strings":["Center for Applied Optimization, University of Florida, Gainesville, FL, USA","Laboratory of Algorithms and Technologies for Network Analysis, National Research University Higher School of Economics, Niznhy Novgorod, Russia"],"affiliations":[{"raw_affiliation_string":"Center for Applied Optimization, University of Florida, Gainesville, FL, USA","institution_ids":["https://openalex.org/I4210089412","https://openalex.org/I33213144"]},{"raw_affiliation_string":"Laboratory of Algorithms and Technologies for Network Analysis, National Research University Higher School of Economics, Niznhy Novgorod, Russia","institution_ids":["https://openalex.org/I118501908"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5075752573"],"corresponding_institution_ids":["https://openalex.org/I4210125392"],"apc_list":null,"apc_paid":null,"fwci":0.5851,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.74095776,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"32","issue":"2","first_page":"312","last_page":"335"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.7246817350387573},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.6702719926834106},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.4903740882873535},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44233208894729614},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35060417652130127},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33138954639434814},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3119078576564789},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.20272386074066162},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1652946174144745},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15000766515731812},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.05392426252365112}],"concepts":[{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.7246817350387573},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.6702719926834106},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.4903740882873535},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44233208894729614},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35060417652130127},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33138954639434814},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3119078576564789},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.20272386074066162},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1652946174144745},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15000766515731812},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.05392426252365112}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2017.1281924","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2017.1281924","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Responsible consumption and production","id":"https://metadata.un.org/sdg/12","score":0.41999998688697815}],"awards":[{"id":"https://openalex.org/G5221418702","display_name":null,"funder_award_id":"14-41-00039","funder_id":"https://openalex.org/F4320321912","funder_display_name":"Ministry of Education and Science of the Russian Federation"},{"id":"https://openalex.org/G8216162248","display_name":null,"funder_award_id":"14-41-00039","funder_id":"https://openalex.org/F4320335266","funder_display_name":"Laboratory of Algorithms and Technologies for Networks Analysis"}],"funders":[{"id":"https://openalex.org/F4320321912","display_name":"Ministry of Education and Science of the Russian Federation","ror":"https://ror.org/00ghqgy32"},{"id":"https://openalex.org/F4320324774","display_name":"Bengbu Medical College","ror":"https://ror.org/01f8qvj05"},{"id":"https://openalex.org/F4320335266","display_name":"Laboratory of Algorithms and Technologies for Networks Analysis","ror":"https://ror.org/055f7t516"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W75795297","https://openalex.org/W149461665","https://openalex.org/W396542372","https://openalex.org/W749637598","https://openalex.org/W1442132175","https://openalex.org/W1594785451","https://openalex.org/W1676999057","https://openalex.org/W1971010887","https://openalex.org/W1983402337","https://openalex.org/W1996872016","https://openalex.org/W2001898386","https://openalex.org/W2008362324","https://openalex.org/W2026320281","https://openalex.org/W2028393984","https://openalex.org/W2037016941","https://openalex.org/W2043005464","https://openalex.org/W2046112356","https://openalex.org/W2068617151","https://openalex.org/W2081768921","https://openalex.org/W2082603400","https://openalex.org/W2098667053","https://openalex.org/W2100505346","https://openalex.org/W2115362620","https://openalex.org/W2116007667","https://openalex.org/W2119605622","https://openalex.org/W2134155515","https://openalex.org/W2170659335","https://openalex.org/W2173409066","https://openalex.org/W2183091601","https://openalex.org/W2401610261","https://openalex.org/W3103809129","https://openalex.org/W4250699352","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2165678151","https://openalex.org/W2082603400","https://openalex.org/W1796509207","https://openalex.org/W3203939381","https://openalex.org/W2140498717","https://openalex.org/W858234464","https://openalex.org/W2162082186","https://openalex.org/W2005991213","https://openalex.org/W4285171291","https://openalex.org/W2951533720"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"BBMCW,":[3],"a":[4,24,77],"new":[5,58,78,102,139],"efficient":[6],"exact":[7,73,177],"maximum":[8],"clique":[9],"algorithm":[10,59,140],"tailored":[11],"for":[12,131],"large":[13,117],"sparse":[14,118,154],"graphs":[15,29,51],"which":[16],"can":[17],"be":[18,40],"bit-encoded":[19],"directly":[20],"into":[21],"memory":[22],"without":[23],"heavy":[25],"performance":[26,164],"penalty.":[27],"These":[28],"occur":[30],"in":[31,95,116,128,163],"real-life":[32],"problems":[33],"when":[34],"some":[35],"form":[36],"of":[37,71,89,107,149,170],"locality":[38],"may":[39],"exploited":[41],"to":[42,174],"reduce":[43],"their":[44],"scale.":[45],"One":[46],"such":[47],"example":[48],"is":[49,60,87],"correspondence":[50],"derived":[52],"from":[53],"data":[54,147,159],"association":[55],"problems.":[56,100],"The":[57,101],"based":[61],"on":[62,124],"the":[63,68,90,105,112,129,138,157,161,175],"bit-parallel":[64,114,132],"kernel":[65,115],"used":[66,94],"by":[67,111],"BBMC":[69,113],"family":[70],"published":[72],"algorithms.":[74],"BBMCW":[75,121],"employs":[76],"bitstring":[79],"encoding":[80,103],"that":[81,137],"we":[82],"denote":[83],"\u2018watched\u2019,":[84],"because":[85],"it":[86],"reminiscent":[88],"\u2018watched":[91],"literal\u2019":[92],"technique":[93],"satisfiability":[96],"and":[97,152],"other":[98],"constraint":[99],"reduces":[104],"number":[106],"spurious":[108],"operations":[109],"computed":[110],"graphs.":[119,155],"Moreover,":[120],"also":[122],"improves":[123],"bound":[125],"computation":[126],"proposed":[127],"literature":[130],"solvers.":[133],"Experimental":[134],"results":[135],"show":[136],"performs":[141],"better":[142],"than":[143,167],"prior":[144],"algorithms":[145],"over":[146],"sets":[148],"both":[150],"real":[151,158],"synthetic":[153],"In":[156],"sets,":[160],"improvement":[162],"averages":[165],"more":[166],"two":[168],"orders":[169],"magnitude":[171],"with":[172],"respect":[173],"state-of-the-art":[176],"solver":[178],"IncMaxCLQ.":[179]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}