{"id":"https://openalex.org/W2794350243","doi":"https://doi.org/10.1145/3148227","title":"Fast Hamiltonicity Checking Via Bases of Perfect Matchings","display_name":"Fast Hamiltonicity Checking Via Bases of Perfect Matchings","publication_year":2018,"publication_date":"2018-03-13","ids":{"openalex":"https://openalex.org/W2794350243","doi":"https://doi.org/10.1145/3148227","mag":"2794350243"},"language":"en","primary_location":{"id":"doi:10.1145/3148227","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3148227","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.tue.nl/ws/files/99596886/1211.1506.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037989463","display_name":"Marek Cygan","orcid":"https://orcid.org/0000-0003-2472-2975"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Marek Cygan","raw_affiliation_strings":["University of Warsaw, Banacha, Warszawa"],"raw_orcid":"https://orcid.org/0000-0003-2472-2975","affiliations":[{"raw_affiliation_string":"University of Warsaw, Banacha, Warszawa","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050140825","display_name":"Stefan Kratsch","orcid":"https://orcid.org/0000-0002-0193-7239"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Kratsch","raw_affiliation_strings":["Max-Planck Institute for Informatics, Bonn"],"raw_orcid":"https://orcid.org/0000-0002-0193-7239","affiliations":[{"raw_affiliation_string":"Max-Planck Institute for Informatics, Bonn","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068357631","display_name":"Jesper Nederlof","orcid":"https://orcid.org/0000-0003-1848-0076"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jesper Nederlof","raw_affiliation_strings":["Utrecht University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Utrecht University","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.5628,"has_fulltext":true,"cited_by_count":41,"citation_normalized_percentile":{"value":0.96541306,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"65","issue":"3","first_page":"1","last_page":"46"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/combinatorics","display_name":"Combinatorics","score":0.8133974075317383},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6169608235359192},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5663792490959167},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5015246868133545},{"id":"https://openalex.org/keywords/block-matrix","display_name":"Block matrix","score":0.482202410697937},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.4801601767539978},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44369056820869446},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.4419171214103699},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4297836422920227},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.30222010612487793},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24114036560058594},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15213638544082642},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07700520753860474}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8133974075317383},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6169608235359192},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5663792490959167},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5015246868133545},{"id":"https://openalex.org/C85817219","wikidata":"https://www.wikidata.org/wiki/Q884772","display_name":"Block matrix","level":3,"score":0.482202410697937},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.4801601767539978},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44369056820869446},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.4419171214103699},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4297836422920227},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.30222010612487793},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24114036560058594},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15213638544082642},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07700520753860474},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3148227","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3148227","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:publications/d75b14a9-92c8-46d6-bf4c-b40d9033fd31","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/d75b14a9-92c8-46d6-bf4c-b40d9033fd31","pdf_url":"https://pure.tue.nl/ws/files/99596886/1211.1506.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cygan, M, Kratsch, S & Nederlof, J 2018, 'Fast Hamiltonicity checking via bases of perfect matchings', Journal of the ACM, vol. 65, no. 3, 12, pp. 1-46. https://doi.org/10.1145/3148227","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/d75b14a9-92c8-46d6-bf4c-b40d9033fd31","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/d75b14a9-92c8-46d6-bf4c-b40d9033fd31","pdf_url":"https://research.tue.nl/nl/publications/d75b14a9-92c8-46d6-bf4c-b40d9033fd31","source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of the ACM, 65(3):12, 1 - 46. Association for Computing Machinery, Inc","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:publications/d75b14a9-92c8-46d6-bf4c-b40d9033fd31","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/d75b14a9-92c8-46d6-bf4c-b40d9033fd31","pdf_url":"https://pure.tue.nl/ws/files/99596886/1211.1506.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cygan, M, Kratsch, S & Nederlof, J 2018, 'Fast Hamiltonicity checking via bases of perfect matchings', Journal of the ACM, vol. 65, no. 3, 12, pp. 1-46. https://doi.org/10.1145/3148227","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4237155059","display_name":null,"funder_award_id":"UMO-2012/05/D/ST6/03214","funder_id":"https://openalex.org/F4320322511","funder_display_name":"Narodowe Centrum Nauki"}],"funders":[{"id":"https://openalex.org/F4320321010","display_name":"Universiteit Utrecht","ror":"https://ror.org/04pp8hn57"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320322511","display_name":"Narodowe Centrum Nauki","ror":"https://ror.org/03ha2q922"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2794350243.pdf","grobid_xml":"https://content.openalex.org/works/W2794350243.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W143512583","https://openalex.org/W200045149","https://openalex.org/W1515822898","https://openalex.org/W1517036688","https://openalex.org/W1527197079","https://openalex.org/W1542928981","https://openalex.org/W1582963151","https://openalex.org/W1592452925","https://openalex.org/W1787126581","https://openalex.org/W1883368305","https://openalex.org/W1971483538","https://openalex.org/W1975286948","https://openalex.org/W1975587904","https://openalex.org/W1981234161","https://openalex.org/W1982687611","https://openalex.org/W1995725694","https://openalex.org/W1996668544","https://openalex.org/W2001868457","https://openalex.org/W2002722727","https://openalex.org/W2012948111","https://openalex.org/W2015321560","https://openalex.org/W2021180976","https://openalex.org/W2028357390","https://openalex.org/W2042986967","https://openalex.org/W2059273723","https://openalex.org/W2065963401","https://openalex.org/W2108350607","https://openalex.org/W2117226423","https://openalex.org/W2120141762","https://openalex.org/W2126436716","https://openalex.org/W2154399201","https://openalex.org/W2165142526","https://openalex.org/W2174446922","https://openalex.org/W2180988813","https://openalex.org/W2340006107","https://openalex.org/W2404960361","https://openalex.org/W2508797883","https://openalex.org/W2561675875","https://openalex.org/W2610479830","https://openalex.org/W4238913085"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2953461625","https://openalex.org/W2077383796","https://openalex.org/W2080136900","https://openalex.org/W2355185940","https://openalex.org/W2365751441","https://openalex.org/W2962785705","https://openalex.org/W2016868849","https://openalex.org/W4400469587","https://openalex.org/W2152668278"],"abstract_inverted_index":{"For":[0],"an":[1,34,86,245],"even":[2],"integer":[3],"t":[4,12,32,37,71,76,91,113,116,125,129,139,158,168],"\u2265":[5],"2,":[6],"the":[7,28,64,93,98,106,123,154,160,164,185,201,223,236,242,267],"Matching":[8],"Connectivity":[9],"matrix":[10,15],"H":[11,36,70,90,115,157],"is":[13,45,83,232],"a":[14,54,110,173,195,216,271],"that":[16,69,183,199,229,244],"has":[17,72],"rows":[18,133],"and":[19,50,57,102,134,159],"columns":[20,101,135],"both":[21],"labeled":[22,136],"by":[23,61,85,137],"all":[24],"perfect":[25],"matchings":[26,99,165],"of":[27,89,95,105,114,156,163,219,270],"complete":[29],"graph":[30],"on":[31,153],"vertices;":[33],"entry":[35],"[":[38],"M":[39,42,48,51],"1":[40,46,49],",":[41,259],"2":[43,52,75,124,128],"]":[44],"if":[47],"form":[53,109],"Hamiltonian":[55],"cycle":[56],"0":[58],"otherwise.":[59],"Motivated":[60],"applications":[62],"for":[63,222,260,280,282],"Hamiltonicity":[65,186],"problem,":[66],"we":[67,171,193,227],"show":[68,228],"rank":[73,155],"exactly":[74],"/2\u22121":[77,126,130],"over":[78],"GF(2).":[79],"The":[80,118],"upper":[81],"bound":[82,120],"established":[84],"explicit":[87],"factorization":[88],"as":[92],"product":[94],"two":[96],"submatrices;":[97],"labeling":[100],"rows,":[103],"respectively,":[104],"submatrices":[107],"therefore":[108],"basis":[111],"X":[112,138,167],".":[117,169],"lower":[119],"follows":[121],"because":[122],"\u00d7":[127],"submatrix":[131],"with":[132,215,247],"can":[140],"be":[141],"seen":[142],"to":[143],"have":[144],"full":[145],"rank.":[146],"We":[147],"obtain":[148],"several":[149],"algorithmic":[150],"results":[151],"based":[152],"particular":[161],"structure":[162],"in":[166,188,203,241],"First,":[170],"present":[172],"1.888":[174],"n":[175,176,209,256,277],"O":[177,210,257],"(1)":[178,211,258],"time":[179,212,249],"Monte":[180,196],"Carlo":[181,197],"algorithm":[182,198,231,246,279],"solves":[184,200],"problem":[187,202],"directed":[189],"bipartite":[190],"graphs.":[191],"Second,":[192],"give":[194],"(2":[204,250,272],"+":[205,251],"\u221a":[206],"2)":[207],"pw":[208,221,255],"when":[213],"provided":[214],"path":[217],"decomposition":[218],"width":[220],"input":[224],"graph.":[225],"Moreover,":[226],"this":[230],"best":[233],"possible":[234],"under":[235],"Strong":[237],"Exponential":[238],"Time":[239],"Hypothesis,":[240],"sense":[243],"running":[248],"\u221a2":[252],"\u2212":[253,273],"\u03f5)":[254],"any":[261],"\u03f5":[262,274,284],">":[263,286],"0,":[264],"would":[265],"imply":[266],"breakthrough":[268],"result":[269],"\u2032":[275,285],")":[276],"-time":[278],"CNF-Sat":[281],"some":[283],"0.":[287]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}