{"id":"https://openalex.org/W2120141762","doi":"https://doi.org/10.1137/110839229","title":"Determinant Sums for Undirected Hamiltonicity","display_name":"Determinant Sums for Undirected Hamiltonicity","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2120141762","doi":"https://doi.org/10.1137/110839229","mag":"2120141762"},"language":"en","primary_location":{"id":"doi:10.1137/110839229","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110839229","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5038787166","display_name":"Andreas Bj\u00f6rklund","orcid":"https://orcid.org/0009-0009-9303-9986"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Andreas Bj\u00f6rklund","raw_affiliation_strings":["Institutionen f\u00f6r datavetenskap"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institutionen f\u00f6r datavetenskap","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5038787166"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":11.793,"has_fulltext":false,"cited_by_count":106,"citation_normalized_percentile":{"value":0.98928792,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"43","issue":"1","first_page":"280","last_page":"299"},"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7736271619796753},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.7195512652397156},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.715634822845459},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6933062672615051},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5932998061180115},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5020670890808105},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.45989492535591125},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4371799826622009},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4289800822734833},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3140787184238434},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19522401690483093}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7736271619796753},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.7195512652397156},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.715634822845459},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6933062672615051},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5932998061180115},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5020670890808105},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.45989492535591125},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4371799826622009},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4289800822734833},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3140787184238434},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19522401690483093},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"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/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/110839229","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110839229","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:lup.lub.lu.se:92db1029-8df3-491d-9233-a31f8bf4c773","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/4318275","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 0097-5397","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1852383912","https://openalex.org/W1968245619","https://openalex.org/W1969186119","https://openalex.org/W1971483538","https://openalex.org/W1975587904","https://openalex.org/W1979740015","https://openalex.org/W1985061810","https://openalex.org/W1995725694","https://openalex.org/W2001868457","https://openalex.org/W2072985157","https://openalex.org/W2080132708","https://openalex.org/W2082180697","https://openalex.org/W2296148711","https://openalex.org/W2508797883"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2371352078","https://openalex.org/W2361554335","https://openalex.org/W2359992618","https://openalex.org/W2953461625","https://openalex.org/W2962785705","https://openalex.org/W4241541331","https://openalex.org/W1979242696","https://openalex.org/W2259723333","https://openalex.org/W1002323541"],"abstract_inverted_index":{"We":[0,129,151],"present":[1],"a":[2,144,164,182],"Monte":[3],"Carlo":[4],"algorithm":[5,119],"for":[6,35,43,99],"Hamiltonicity":[7,156,159],"detection":[8],"in":[9,15,82,86,92,127,169],"an":[10,153],"$n$-vertex":[11],"undirected":[12],"graph":[13],"running":[14],"$O(1.657^{n})$":[16],"time.":[17,112],"To":[18],"the":[19,26,31,36,39,44,88,107,114,117,137],"best":[20],"of":[21,148,155,185],"our":[22],"knowledge,":[23],"this":[24],"is":[25,143],"first":[27,89],"superpolynomial":[28],"improvement":[29],"on":[30,96],"worst":[32],"case":[33],"runtime":[34],"problem":[37,47,91],"since":[38],"$O^*(2^n)$":[40],"bound":[41,108],"established":[42],"traveling":[45],"salesman":[46],"(TSP)":[48],"over":[49,181],"50":[50],"years":[51],"ago":[52],"[R.":[53],"Bellman,":[54],"J.":[55,69],"Assoc.":[56],"Comput.":[57],"Mach.,":[58],"9":[59],"(1962),":[60,75],"pp.":[61,76],"61--63],":[62],"[M.":[63],"Held":[64],"and":[65,116,160],"R.":[66],"M.":[67],"Karp,":[68],"Soc.":[70],"Indust.":[71],"Appl.":[72],"Math.,":[73],"10":[74],"196--210].":[77],"($O^*(f(n))$":[78],"suppresses":[79],"polylogarithmic":[80],"functions":[81],"$f(n)$).":[83],"It":[84],"answers":[85],"part":[87],"open":[90],"Woeginger's":[93],"2003":[94],"survey":[95],"exact":[97],"algorithms":[98],"NP-hard":[100],"problems.":[101],"For":[102],"bipartite":[103,115],"graphs,":[104],"we":[105,171],"improve":[106],"to":[109,123,135,163,174],"$O^*(\\sqrt{2}^n)\\subset":[110],"O(1.415^{n})$":[111],"Both":[113],"general":[118],"can":[120,193],"be":[121,194],"implemented":[122],"use":[124],"space":[125],"polynomial":[126],"$n$.":[128],"combine":[130],"several":[131],"recently":[132],"resurrected":[133],"ideas":[134],"get":[136],"results.":[138],"Our":[139],"main":[140],"technical":[141],"contribution":[142],"new":[145],"algebraic":[146],"characterization":[147],"Hamiltonian":[149],"graphs.":[150],"introduce":[152],"extension":[154],"called":[157],"Labeled":[158,165,189],"relate":[161],"it":[162],"Cycle":[166,190],"Cover":[167,191],"Sum":[168,192],"which":[170],"are":[172],"set":[173],"count":[175],"weighted":[176],"arc":[177],"labeled":[178],"cycle":[179],"covers":[180],"finite":[183],"field":[184],"characteristic":[186],"two.":[187],"The":[188],"evaluated":[195],"efficiently":[196],"via":[197],"determinants.":[198]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":9},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}