{"id":"https://openalex.org/W1968952709","doi":"https://doi.org/10.1145/2488608.2488646","title":"Fast hamiltonicity checking via bases of perfect matchings","display_name":"Fast hamiltonicity checking via bases of perfect matchings","publication_year":2013,"publication_date":"2013-05-28","ids":{"openalex":"https://openalex.org/W1968952709","doi":"https://doi.org/10.1145/2488608.2488646","mag":"1968952709"},"language":"en","primary_location":{"id":"doi:10.1145/2488608.2488646","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2488608.2488646","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fifth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","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/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, Warsaw, Poland","University of Warsaw , Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]},{"raw_affiliation_string":"University of Warsaw , Warsaw, Poland","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/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Kratsch","raw_affiliation_strings":["Technical University Berlin, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"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, Utrecht, Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Utrecht University, Utrecht, Netherlands","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":null,"has_fulltext":false,"cited_by_count":52,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"301","last_page":"310"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9991999864578247,"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/T11476","display_name":"Graph theory and applications","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.710484504699707},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.618701696395874},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6141804456710815},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5626381635665894},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47918784618377686},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46420058608055115},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2686205208301544}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.710484504699707},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.618701696395874},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6141804456710815},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5626381635665894},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47918784618377686},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46420058608055115},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2686205208301544}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2488608.2488646","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2488608.2488646","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fifth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W1517036688","https://openalex.org/W1527197079","https://openalex.org/W1542928981","https://openalex.org/W1592452925","https://openalex.org/W1787126581","https://openalex.org/W1816837704","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/W2015963099","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/W2126436716","https://openalex.org/W2139087151","https://openalex.org/W2151732151","https://openalex.org/W2154399201","https://openalex.org/W2165142526","https://openalex.org/W2174446922","https://openalex.org/W2296469570","https://openalex.org/W2508797883","https://openalex.org/W2610479830","https://openalex.org/W4239610380","https://openalex.org/W4298227433","https://openalex.org/W6632353237","https://openalex.org/W6635454507","https://openalex.org/W6635746246","https://openalex.org/W6653854142"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W4390409907","https://openalex.org/W2586280130","https://openalex.org/W4221143622","https://openalex.org/W2962785705","https://openalex.org/W2016868849","https://openalex.org/W4400469587","https://openalex.org/W2151412766","https://openalex.org/W2963157282","https://openalex.org/W2249499697"],"abstract_inverted_index":{"For":[0],"an":[1,34,79,124,183,245],"even":[2],"integer":[3],"t":[4,32],"\u2265":[5],"2,":[6],"the":[7,27,51,55,63,108,120,133,145,159,166,172,208,226,241],"Matching":[8],"Connectivity":[9],"matrix":[10,14],"Ht":[11,71],"is":[12,37,42],"a":[13,43,177,191,233],"that":[15,70,82,107,131,181,213],"has":[16,72],"rows":[17],"and":[18,46],"columns":[19],"both":[20],"labeled":[21],"by":[22,50],"all":[23],"perfect":[24],"matchings":[25,87,111],"of":[26,54,65,86,110,147,194,244],"complete":[28],"graph":[29,185],"Kt":[30],"on":[31,62,186],"vertices;":[33],"entry":[35],"Ht[M1,M2]":[36],"1":[38],"if":[39],"M1\u222a":[40],"M2":[41],"Hamiltonian":[44,148],"cycle":[45],"0":[47],"otherwise.":[48],"Motivated":[49],"computational":[52],"study":[53],"Hamiltonicity":[56,134,200],"problem,":[57],"we":[58,94,105,164,206],"present":[59,176],"three":[60],"results":[61],"structure":[64],"Ht:":[66],"We":[67,118],"first":[68],"show":[69,95,212],"rank":[73],"exactly":[74],"2t/2-1":[75],"over":[76],"GF(2)":[77],"via":[78],"appropriate":[80],"factorization":[81,121],"explicitly":[83],"provides":[84],"families":[85],"Xt":[88,112],"forming":[89],"bases":[90],"for":[91,214,236,249],"Ht.":[92,117],"Second,":[93],"how":[96],"to":[97,122,175,211,222],"quickly":[98],"change":[99,169],"representation":[100],"between":[101],"such":[102],"bases.":[103],"Third,":[104],"notice":[106],"sets":[109],"induce":[113],"permutation":[114],"matrices":[115],"within":[116],"use":[119,165,207],"derive":[123],"1.888n":[125],"nO(1)":[126,203],"time":[127,161,224,247],"Monte":[128,178],"Carlo":[129,179],"algorithm":[130,141,170,180,235,248],"solves":[132],"problem":[135,238],"in":[136,152,158,201],"directed":[137,153],"bipartite":[138,154],"graphs.":[139],"Our":[140],"as":[142],"well":[143],"counts":[144],"number":[146],"cycles":[149],"modulo":[150],"two":[151],"or":[155],"undirected":[156,184],"graphs":[157],"same":[160],"bound.":[162],"Moreover,":[163],"fast":[167],"basis":[168],"from":[171],"second":[173],"result":[174,210,243],"given":[182],"n":[187],"vertices":[188],"along":[189],"with":[190],"path":[192],"decomposition":[193],"width":[195],"at":[196],"most":[197],"pw":[198],"decides":[199],"(2+\u221a2)pw":[202],"time.":[204],"Finally,":[205],"third":[209],"every":[215],"\u03b5":[216],">0":[217],"this":[218,237],"cannot":[219],"be":[220],"improved":[221],"(2+\u221a2-\u03b5)pwnO(1)":[223],"unless":[225],"Strong":[227],"Exponential":[228],"Time":[229],"Hypothesis":[230],"fails,":[231],"i.e.,":[232],"faster":[234],"would":[239],"imply":[240],"breakthrough":[242],"O((2-\u03b5')n)":[246],"CNF-Sat.":[250]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":7}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}