{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:37:51Z","timestamp":1773931071480,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"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":8812,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1016\/0890-5401(89)90035-7","type":"journal-article","created":{"date-parts":[[2004,12,2]],"date-time":"2004-12-02T00:24:20Z","timestamp":1101947060000},"page":"318-333","source":"Crossref","is-referenced-by-count":25,"title":["Parallei graph algorithms that are efficient on average"],"prefix":"10.1016","volume":"81","author":[{"given":"Don","family":"Coppersmith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prabhakar","family":"Raghavan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Tompa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(89)90035-7_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. Comput. System Sci."},{"key":"10.1016\/0890-5401(89)90035-7_bib2","author":"Billingsley","year":"1979"},{"key":"10.1016\/0890-5401(89)90035-7_bib3","author":"Bollob\u00e1s","year":"1985"},{"issue":"1","key":"10.1016\/0890-5401(89)90035-7_bib4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF02122551","article-title":"The chromatic number of the random graph","volume":"8","author":"Bollob\u00e1s","year":"1988","journal-title":"Combinatorica"},{"key":"10.1016\/0890-5401(89)90035-7_bib5","series-title":"The Travelling Salesman Problem","article-title":"Hamiltonian Cycles","author":"Chvatal","year":"1985"},{"key":"10.1016\/0890-5401(89)90035-7_bib6","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Control."},{"key":"10.1016\/0890-5401(89)90035-7_bib7","volume":"Vol. I","author":"Feller","year":"1968"},{"key":"10.1016\/0890-5401(89)90035-7_bib8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0020-0190(87)90229-8","article-title":"Parallel algorithms for finding Hamilton cycles in random graphs","volume":"25","author":"Frieze","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(89)90035-7_bib9","series-title":"Combinatorial Optimization: Annotated Bibliographies","first-page":"52","article-title":"Probabilistic Analysis","author":"Karp","year":"1985"},{"key":"10.1016\/0890-5401(89)90035-7_bib10","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0012-365X(83)90021-3","article-title":"Limit distributions for the existence of Hamilton cycles in a random graph","volume":"43","author":"Koml\u00f3s","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0890-5401(89)90035-7_bib11","series-title":"Proceedings. 27th Annual IEEE Symposium on Foundations of Computer Science","first-page":"10","article-title":"Probabilistic construction of deterministic algorithms: Approximating packing integer programs","author":"Raghavan","year":"1986"},{"key":"10.1016\/0890-5401(89)90035-7_bib12","author":"Reif","year":"1982"},{"key":"10.1016\/0890-5401(89)90035-7_bib13","series-title":"Proceedings, Principles of Distributed Computing","article-title":"N-processors graphs distributively achieve perfect matchings inO(log2N) beats","author":"Shamir","year":"1982"},{"key":"10.1016\/0890-5401(89)90035-7_bib14","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1016\/0196-6774(84)90003-8","article-title":"Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces","volume":"5","author":"Shamir","year":"1984","journal-title":"J. Algorithms"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900357?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900357?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T18:27:04Z","timestamp":1549045624000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540189900357"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["0890540189900357"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(89)90035-7","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}