{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T19:20:52Z","timestamp":1775503252517,"version":"3.50.1"},"reference-count":29,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1979,4,1]],"date-time":"1979-04-01T00:00:00Z","timestamp":291772800000},"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":12526,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1979,4]]},"DOI":"10.1016\/0022-0000(79)90045-x","type":"journal-article","created":{"date-parts":[[2003,12,5]],"date-time":"2003-12-05T11:41:56Z","timestamp":1070624516000},"page":"155-193","source":"Crossref","is-referenced-by-count":366,"title":["Fast probabilistic algorithms for hamiltonian circuits and matchings"],"prefix":"10.1016","volume":"18","author":[{"given":"D.","family":"Angluin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.G.","family":"Valiant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(79)90045-X_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0022-0000(79)90045-X_BIB2","series-title":"Proceedings of the Third Annual ACM Symposium on the Theory of Computing","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Coox","year":"1971"},{"key":"10.1016\/0022-0000(79)90045-X_BIB3","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/S0022-0000(73)80029-7","article-title":"Time-bounded random access machines","volume":"7","author":"Cook","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(79)90045-X_BIB4","first-page":"69","article-title":"Some theorems on abstract graphs","volume":"2","author":"Dirac","year":"1952"},{"key":"10.1016\/0022-0000(79)90045-X_BIB5","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\/0022-0000(79)90045-X_BIB6","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs I","volume":"6","author":"Erd\u00f6s","year":"1959","journal-title":"Publ. Math. Debrecen"},{"key":"10.1016\/0022-0000(79)90045-X_BIB7","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF01894879","article-title":"On the existence of a factor of degree one of connected random graphs","volume":"17","author":"Erd\u00f6s","year":"1966","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"10.1016\/0022-0000(79)90045-X_BIB8","series-title":"Probabilistic Methods in Combinatorics","author":"Erd\u00d6s","year":"1974"},{"key":"10.1016\/0022-0000(79)90045-X_BIB9","series-title":"Proceedings of the 16th IEEE Symposium on Foundations of Computer Science","first-page":"100","article-title":"An O(n2.5) algorithm for maximum matching in general graphs","author":"Even","year":"1975"},{"key":"10.1016\/0022-0000(79)90045-X_BIB10","volume":"Vol. I","author":"Feller","year":"1968"},{"key":"10.1016\/0022-0000(79)90045-X_BIB11","first-page":"313","article-title":"On colouring random graphs","volume":"77","author":"Grimmett","year":"1975"},{"key":"10.1016\/0022-0000(79)90045-X_BIB12","first-page":"35","article-title":"Algorithms with bounds for problems of discrete optimizations","volume":"31","author":"Guimady","year":"1976","journal-title":"Problemy Kibernet."},{"key":"10.1016\/0022-0000(79)90045-X_BIB13","series-title":"Tezisy III Vsesoyznoi Konferencii po Problemam Teoreticheskoi Kibernetiki","first-page":"125","article-title":"On statistically efficient algorithms for some extremal problems from graph theory","author":"Guimady","year":"1974"},{"key":"10.1016\/0022-0000(79)90045-X_BIB14","series-title":"16th IEEE Symposium on the Foundations of Computer Science","first-page":"57","article-title":"On time versus space and related problems","author":"Hopcroft","year":"1975"},{"key":"10.1016\/0022-0000(79)90045-X_BIB15","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0022-0000(79)90045-X_BIB16","series-title":"Algorithms and Complexity","article-title":"The probabilistic analysis of some combinatorial search algorithms","author":"Karp","year":"1976"},{"key":"10.1016\/0022-0000(79)90045-X_BIB17","unstructured":"J. KOML\u00d3S AND E. SZEMER\u00c9DI, private communication."},{"key":"10.1016\/0022-0000(79)90045-X_BIB18","first-page":"1100","article-title":"On the power of some classes of graphs","volume":"11","author":"Kor\u0161unov","year":"1970","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0022-0000(79)90045-X_BIB19","first-page":"760","article-title":"Solution of a problem of Erd\u00f6s and R\u00e9nyi on Hamiltonian cycles in nonoriented graphs","volume":"17","author":"Kor\u0161unov","year":"1976","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0022-0000(79)90045-X_BIB20","series-title":"Reversible concatenable lists","author":"Lev","year":"1976"},{"key":"10.1016\/0022-0000(79)90045-X_BIB21","first-page":"115","article-title":"Universal combinatorial problems","volume":"9","author":"Levin","year":"1972","journal-title":"Problemy Pereda\u010di Informacii"},{"key":"10.1016\/0022-0000(79)90045-X_BIB22","first-page":"1376","article-title":"On two problems from the theory of graphs","volume":"11","author":"Perepelica","year":"1970","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0022-0000(79)90045-X_BIB23","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0012-365X(76)90068-6","article-title":"Hamiltonian circuits in random graphs","volume":"14","author":"Posh","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0022-0000(79)90045-X_BIB24","series-title":"Algorithms and Complexity","article-title":"Probabilistic algorithms","author":"Rabin","year":"1976"},{"key":"10.1016\/0022-0000(79)90045-X_BIB25","series-title":"Proceedings of the Third International Colloquium on Automata, Languages and Programming","first-page":"322","article-title":"Optimal algorithms for self-reducible problems","author":"Chnorr","year":"1976"},{"key":"10.1016\/0022-0000(79)90045-X_BIB26","series-title":"String-matching in real time","author":"Slisenko","year":"1977"},{"key":"10.1016\/0022-0000(79)90045-X_BIB27","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/0206006","article-title":"A fast Monte-Carlo test for primality","volume":"6","author":"Solovay","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(79)90045-X_BIB28","first-page":"384","article-title":"For how many edges is a digraph almost certainly Hamiltonian?","volume":"41","author":"Wright","year":"1973"},{"key":"10.1016\/0022-0000(79)90045-X_BIB29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02392023","article-title":"Graphs on unlabelled nodes with a given number of edges","volume":"126","author":"Wright","year":"1971","journal-title":"Acta Math."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200007990045X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200007990045X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T15:55:31Z","timestamp":1682610931000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200007990045X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,4]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1979,4]]}},"alternative-id":["002200007990045X"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(79)90045-x","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1979,4]]}}}