{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:41:34Z","timestamp":1777596094337,"version":"3.51.4"},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8843,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1989,5]]},"DOI":"10.1016\/0012-365x(89)90100-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:43Z","timestamp":1027640623000},"page":"373-379","source":"Crossref","is-referenced-by-count":14,"title":["A simple linear expected time algorithm for finding a hamilton path"],"prefix":"10.1016","volume":"75","author":[{"given":"Andrew","family":"Thomason","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(89)90100-3_BIB1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","article-title":"Fast probabilistic algorithms for hamilton circuits and matchings","volume":"18","author":"Angluin","year":"1979","journal-title":"J. Computer and System Sci."},{"key":"10.1016\/0012-365X(89)90100-3_BIB2","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/0012-365X(89)90100-3_BIB3","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF02579321","article-title":"An algorithm for finding Hamiltonian cycles in random graphs","volume":"7","author":"Bollob\u00e1s","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(89)90100-3_BIB4","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Ann. Math. Stat."},{"key":"10.1016\/0012-365X(89)90100-3_BIB5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(72)90079-9","article-title":"A note on hamiltonian circuits","volume":"2","author":"Chv\u00e1tal","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(89)90100-3_BIB6","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/0012-365X(89)90100-3_BIB7","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1137\/0216034","article-title":"Expected computation time for hamiltonian path problem and clique problems","volume":"16","author":"Gurevich","year":"1987","journal-title":"SIAM J. Comp."},{"key":"10.1016\/0012-365X(89)90100-3_BIB8","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0110015","article-title":"A dynamic programming approach to sequencing problems","volume":"10","author":"Held","year":"1962","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"10.1016\/0012-365X(89)90100-3_BIB9","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0196-6774(84)90032-4","article-title":"The NP-completeness column: an ongoing guide","volume":"5","author":"Johnson","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0012-365X(89)90100-3_BIB10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationships between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0012-365X(89)90100-3_BIB11","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02579348","article-title":"How many random edges make a graph Hamiltonian?","volume":"3","author":"Shamir","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/0012-365X(89)90100-3_BIB12","first-page":"307","article-title":"Pseudo-random graphs","volume":"33","author":"Thomason","year":"1987","journal-title":"Annals of Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X89901003?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X89901003?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:50:37Z","timestamp":1555120237000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X89901003"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["0012365X89901003"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(89)90100-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}