{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T23:09:14Z","timestamp":1757545754445},"reference-count":7,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1986,4,1]],"date-time":"1986-04-01T00:00:00Z","timestamp":512697600000},"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":[[1986,4]]},"DOI":"10.1016\/0020-0190(86)90098-0","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"223-229","source":"Crossref","is-referenced-by-count":19,"title":["An O(log n) algorithm for parallel update of minimum spanning trees"],"prefix":"10.1016","volume":"22","author":[{"given":"Shaunak","family":"Pawagi","sequence":"first","affiliation":[]},{"given":"I.V.","family":"Ramakrishnan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(86)90098-0_BIB1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0022-0000(78)90022-3","article-title":"Algorithms for updating minimum spanning trees","volume":"16","author":"Chin","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(86)90098-0_BIB2","series-title":"Proc. 15th STOC","first-page":"252","article-title":"Data structure for on-line updating of minimum spanning trees","author":"Frederickson","year":"1983"},{"key":"10.1016\/0020-0190(86)90098-0_BIB3","series-title":"14th Internat. Conf. on Parallel Processing","article-title":"Parallel update of graph properties in logarithmic time","author":"Pawagi","year":"1985"},{"key":"10.1016\/0020-0190(86)90098-0_BIB4","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1137\/0210051","article-title":"Fast efficient parallel algorithms for some graph problems","volume":"10","author":"Savage","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(86)90098-0_BIB5","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1137\/0204032","article-title":"On finding and updating spanning trees and shortest paths","volume":"4","author":"Spira","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(86)90098-0_BIB6","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1137\/0213036","article-title":"Efficient parallel algorithms for a class of graph-theoretic problems","volume":"14","author":"Tsin","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(86)90098-0_BIB7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0196-6774(83)90033-0","article-title":"Implementation of simultaneous memory access in models that forbid it","volume":"4","author":"Vishkin","year":"1983","journal-title":"J. Algorithms"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900980?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900980?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:29:45Z","timestamp":1553592585000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019086900980"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,4]]},"references-count":7,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1986,4]]}},"alternative-id":["0020019086900980"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90098-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1986,4]]}}}