{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:32:53Z","timestamp":1774369973077,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1988,6]]},"DOI":"10.1016\/0196-6774(88)90037-5","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"181-204","source":"Crossref","is-referenced-by-count":37,"title":["An algorithm for finding hamilton cycles in random directed graphs"],"prefix":"10.1016","volume":"9","author":[{"given":"A.M","family":"Frieze","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(88)90037-5_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0196-6774(88)90037-5_BIB2","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","article-title":"Fast probalistic algorithms for Hamilton circuits and matchings","volume":"18","author":"Angluin","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(88)90037-5_BIB3","series-title":"Graph Theory and Combinatorics Proceedings, Cambridge Combinatorial Conference in Honour of Paul Erdos","first-page":"335","article-title":"The evolution of sparse graphs","author":"Bollobas","year":"1984"},{"key":"10.1016\/0196-6774(88)90037-5_BIB4","series-title":"Random Graphs","author":"Bollobas","year":"1985"},{"key":"10.1016\/0196-6774(88)90037-5_BIB5","series-title":"Proccedings, 17th Annual ACM Symposium on Theory of Computing","first-page":"430","article-title":"An algorithm for finding hamilton cycles in random graphs","author":"Bollobas","year":"1985"},{"key":"10.1016\/0196-6774(88)90037-5_BIB6","unstructured":"M. E. Dyer and A. M. Frieze, On patching algorithms for random asymmetric travelling salesman problems, to appear."},{"key":"10.1016\/0196-6774(88)90037-5_BIB7","first-page":"455","article-title":"On random matrices","author":"Erdos","year":"1964","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"10.1016\/0196-6774(88)90037-5_BIB8","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1137\/0204043","article-title":"Network flow and testing graph connectivity","volume":"4","author":"Even","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(88)90037-5_BIB9","unstructured":"A. M. Frieze, On the exact solution of random travelling salesman problems with medium sized integer costs, to appear."},{"key":"10.1016\/0196-6774(88)90037-5_BIB10","doi-asserted-by":"crossref","first-page":"13","DOI":"10.2307\/2282952","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\/0196-6774(88)90037-5_BIB11","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1137\/0208045","article-title":"A patching algorithm for the non-symmetric travelling salesman problem","volume":"8","author":"Karp","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(88)90037-5_BIB12","series-title":"The Travelling Salesman Problem: A Guided Tour","article-title":"Probabilistic analysis of heuristics","author":"Karp","year":"1985"},{"key":"10.1016\/0196-6774(88)90037-5_BIB13","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 random graphs","volume":"43","author":"Komlos","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0196-6774(88)90037-5_BIB14","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BFb0120903","article-title":"Clutter percolation and random graphs","volume":"13","author":"McDiarmid","year":"1980","journal-title":"Math. Programming Stud."},{"key":"10.1016\/0196-6774(88)90037-5_BIB15","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(80)90172-7","article-title":"Matchings in randon regular bipartite graphs","volume":"31","author":"Walkup","year":"1980","journal-title":"Discrete Math."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677488900375?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677488900375?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:24:14Z","timestamp":1548743054000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677488900375"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["0196677488900375"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(88)90037-5","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}