{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T10:52:13Z","timestamp":1648551133809},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"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":[[1993,3]]},"DOI":"10.1016\/0020-0190(93)90019-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"159-163","source":"Crossref","is-referenced-by-count":6,"title":["An O(log m) parallel algorithm for the minimum spanning tree problem"],"prefix":"10.1016","volume":"45","author":[{"given":"Francis","family":"Suraweera","sequence":"first","affiliation":[]},{"given":"Prabir","family":"Bhattacharya","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90019-6_BIB1","author":"Aho","year":"1983"},{"key":"10.1016\/0020-0190(93)90019-6_BIB2","author":"Akl","year":"1989"},{"key":"10.1016\/0020-0190(93)90019-6_BIB3","author":"Baase","year":"1988"},{"key":"10.1016\/0020-0190(93)90019-6_BIB4","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\/0020-0190(93)90019-6_BIB5","first-page":"478","article-title":"Approximate and exact parallel scheduling with applications to list, tree and graph problems","author":"Cole","year":"1986","journal-title":"Proc. 27th Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(93)90019-6_BIB6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/0215006","article-title":"Upper and lower time bounds for parallel random access machines without simultaneous writes","volume":"15","author":"Cook","year":"1986","journal-title":"Siam J. Comput."},{"key":"10.1016\/0020-0190(93)90019-6_BIB7","author":"Gibbons","year":"1988"},{"key":"10.1016\/0020-0190(93)90019-6_BIB8","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0020-0190(90)90015-P","article-title":"A parallel algorithm for eliminating cycles undirected graphs","volume":"34","author":"Klein","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(93)90019-6_BIB9","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0020-0190(93)90019-6_BIB10","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/2514.2515","article-title":"Parallel graph algorithms","volume":"16","author":"Quinn","year":"1984","journal-title":"Computing Surveys"},{"key":"10.1016\/0020-0190(93)90019-6_BIB11","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0166-3615(89)90048-1","article-title":"A fast algorithm for the minimum spanning tree","volume":"13","author":"Suraweera","year":"1989","journal-title":"Computers in Industry"},{"key":"10.1016\/0020-0190(93)90019-6_BIB12","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0020-0190(75)90056-3","article-title":"An O(\\t|E\\t|log log\\t|V\\t|) algorithm for finding minimum spanning trees","volume":"4","author":"Yao","year":"1975","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093900196?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093900196?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:26:15Z","timestamp":1555143975000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019093900196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["0020019093900196"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90019-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}