{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T05:43:35Z","timestamp":1698212615933},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1988,4,1]],"date-time":"1988-04-01T00:00:00Z","timestamp":575856000000},"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":9238,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1988,4]]},"DOI":"10.1016\/0095-8956(88)90089-5","type":"journal-article","created":{"date-parts":[[2004,12,22]],"date-time":"2004-12-22T01:35:48Z","timestamp":1103679348000},"page":"230-250","source":"Crossref","is-referenced-by-count":24,"title":["Finding hamilton cycles in sparse random graphs"],"prefix":"10.1016","volume":"44","author":[{"given":"A.M","family":"Frieze","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(88)90089-5_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579172","article-title":"The longest path in a random graph","volume":"1","author":"Ajtai","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/0095-8956(88)90089-5_BIB2","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":"D'Angluin","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0095-8956(88)90089-5_BIB3","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0195-6698(80)80030-8","article-title":"A probabilistic proof of an asymptotic formula for the number of labelled regular graphs","volume":"1","author":"Bollob\u00e1s","year":"1980","journal-title":"European J. Combin."},{"key":"10.1016\/0095-8956(88)90089-5_BIB4","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF02579230","article-title":"Long paths in sparse random graphs","volume":"2","author":"Bollob\u00e1s","year":"1982","journal-title":"Combinatorica"},{"key":"10.1016\/0095-8956(88)90089-5_BIB5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0195-6698(83)80039-0","article-title":"Almost all regular graphs are hamiltonian","volume":"4","author":"Bollob\u00e1s","year":"1983","journal-title":"European J. Combin."},{"key":"10.1016\/0095-8956(88)90089-5_BIB6","series-title":"Graph Theory and Combinatorics, Proceedings of Cambridge Conference in Honour of Paul Erd\u00f6s","first-page":"59","article-title":"Long cycles in sparse random graphs","author":"Bollob\u00e1s","year":"1984"},{"key":"10.1016\/0095-8956(88)90089-5_BIB7","series-title":"Proceedings of the 17th annual ACM Symposium on the Theory of Computer Science","first-page":"430","article-title":"An algorithm for finding hamilton cycles in random graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/0095-8956(88)90089-5_BIB8","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF02579431","article-title":"On the connectivity of random m-rientable graphs and digraphs","volume":"2","author":"Fenner","year":"1982","journal-title":"Combinatorica"},{"key":"10.1016\/0095-8956(88)90089-5_BIB9","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0012-365X(83)90046-8","article-title":"On the existence of hamilton cycles in a class of random graphs","volume":"45","author":"Fenner","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(88)90089-5_BIB10","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0095-8956(84)90066-2","article-title":"Hamilton cycles in random regular graphs","volume":"37","author":"Fenner","year":"1984","journal-title":"J. Combin. Theor"},{"key":"10.1016\/0095-8956(88)90089-5_BIB11","first-page":"335","article-title":"Long paths in random graphs","volume":"14","author":"Fernandez de la Vega","year":"1979","journal-title":"Studia Math. Hungar."},{"key":"10.1016\/0095-8956(88)90089-5_BIB12","doi-asserted-by":"crossref","unstructured":"A. M. Frieze, Large matchings and cycles in sparse random graphs, Discrete Math., in press.","DOI":"10.1016\/0012-365X(86)90171-8"},{"key":"10.1016\/0095-8956(88)90089-5_BIB13","unstructured":"A. M. Frieze, On the exact solution of random travelling salesman problems with medium sized integer costs, to appear."},{"key":"10.1016\/0095-8956(88)90089-5_BIB14","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","article-title":"Probability inequalities for sums of bounded random variables","volume":"58","author":"Hoeffding","year":"1963","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/0095-8956(88)90089-5_BIB15","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0012-365X(83)90021-3","article-title":"Limit distribution for the existence of hamilton cycles in a random graph","volume":"43","author":"Koml\u00f3s","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(88)90089-5_BIB16","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0012-365X(76)90068-6","article-title":"Hamilton circuits in random graphs","volume":"14","author":"P\u00f3sa","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(88)90089-5_BIB17","unstructured":"B. Richmond, R. W. Robinson, and N. C. Wormald,"},{"key":"10.1016\/0095-8956(88)90089-5_BIB18","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"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895688900895?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895688900895?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:51:48Z","timestamp":1548881508000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895688900895"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,4]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988,4]]}},"alternative-id":["0095895688900895"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(88)90089-5","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1988,4]]}}}