{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T03:27:39Z","timestamp":1762658859612},"reference-count":14,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1980,12,1]],"date-time":"1980-12-01T00:00:00Z","timestamp":344476800000},"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":[[1980,12]]},"DOI":"10.1016\/0196-6774(80)90017-6","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"374-393","source":"Crossref","is-referenced-by-count":23,"title":["Linear expected-time algorithms for connectivity problems"],"prefix":"10.1016","volume":"1","author":[{"given":"Richard M","family":"Karp","sequence":"first","affiliation":[]},{"given":"Robert Endre","family":"Tarjan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(80)90017-6_BIB1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","article-title":"Fast probabilistic algorithms for Hamiltonian paths","volume":"18","author":"Angluin","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(80)90017-6_BIB2","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1137\/0205051","article-title":"Finding minimum spanning trees","volume":"5","author":"Cheriton","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(80)90017-6_BIB3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/0196-6774(80)90017-6_BIB4","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0898-1221(75)90037-1","article-title":"On sparse graphs with dense long paths","volume":"1","author":"Erd\u00f6s","year":"1975","journal-title":"Comp. Math. Appl."},{"key":"10.1016\/0196-6774(80)90017-6_BIB5","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erd\u00f6s","year":"1960","journal-title":"Magyar Tud. Akad. Mat. Kut. Int. K\u00f6zl."},{"key":"10.1016\/0196-6774(80)90017-6_BIB6","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/362248.362272","article-title":"Efficient algorithms for graph manipulation","volume":"16","author":"Hopcroft","year":"1973","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(80)90017-6_BIB7","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1137\/0208045","article-title":"A patching algorithm for the nonsymmetric travelling salesman problem","volume":"8","author":"Karp","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(80)90017-6_BIB8","author":"Knuth","year":"1975"},{"key":"10.1016\/0196-6774(80)90017-6_BIB9","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0196-6774(80)90017-6_BIB10","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1137\/0207011","article-title":"An algorithm for transitive closure with linear expected time","volume":"7","author":"Schnorr","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(80)90017-6_BIB11","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(80)90017-6_BIB12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","article-title":"Efficiency of a good but not lienar set union algorithm","volume":"22","author":"Tarjan","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(80)90017-6_BIB13","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1145\/359460.359478","article-title":"A data structure for manipulating priority queues","volume":"21","author":"Vuillemin","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(80)90017-6_BIB14","first-page":"21","article-title":"An O(\u2225E\u2225log log\u2225E\u2225) algorithm for finding minimum spanning trees","volume":"4","author":"Yao","year":"1975"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677480900176?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677480900176?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:55:04Z","timestamp":1548744904000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677480900176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,12]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1980,12]]}},"alternative-id":["0196677480900176"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(80)90017-6","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1980,12]]}}}