{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T06:25:37Z","timestamp":1648621537246},"reference-count":4,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,5,1]],"date-time":"1987-05-01T00:00:00Z","timestamp":546825600000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1987,5]]},"DOI":"10.1016\/0020-0190(87)90229-8","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T20:00:31Z","timestamp":1049486431000},"page":"111-117","source":"Crossref","is-referenced-by-count":12,"title":["Parallel algorithms for finding Hamilton cycles in random graphs"],"prefix":"10.1016","volume":"25","author":[{"given":"A.M.","family":"Frieze","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(87)90229-8_BIB1","series-title":"Proc. 17th Ann. ACM Symp. on Theory of Computing","first-page":"430","article-title":"An algorithm for finding hamilton cycles in random graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/0020-0190(87)90229-8_BIB2","series-title":"Proc. 11th Ann. ACM Symp. on Theory of Computing","first-page":"114","article-title":"Parallelism in random access machines","author":"Fortune","year":"1978"},{"key":"10.1016\/0020-0190(87)90229-8_BIB3","unstructured":"Y. Gurevich and S. Shelah, Expected computation time for hamilton path problems, SIAM J. Comput., to appear."},{"key":"10.1016\/0020-0190(87)90229-8_BIB4","unstructured":"A. Thomason, A simple linear expected time algorithm for the hamilton cycle problem, to appear."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087902298?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087902298?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T01:26:26Z","timestamp":1553390786000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019087902298"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,5]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,5]]}},"alternative-id":["0020019087902298"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(87)90229-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1987,5]]}}}