{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T16:24:14Z","timestamp":1648743854492},"reference-count":12,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"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 Systems Architecture"],"published-print":{"date-parts":[[1996,11]]},"DOI":"10.1016\/1383-7621(96)00020-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:26:53Z","timestamp":1027621613000},"page":"315-325","source":"Crossref","is-referenced-by-count":0,"title":["Parallel updating algorithms for graph searching problems"],"prefix":"10.1016","volume":"42","author":[{"given":"Pranay","family":"Chaudhuri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/1383-7621(96)00020-3_bib1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01934690","article-title":"Fast parallel graph searching with applications","volume":"28","author":"Chaudhuri","year":"1988","journal-title":"BIT"},{"key":"10.1016\/1383-7621(96)00020-3_bib2","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1093\/comjnl\/33.3.247","article-title":"Finding and updating depth-first search spanning trees of acyclic graphs","volume":"33","author":"Chaudhuri","year":"1990","journal-title":"Computer Journal"},{"key":"10.1016\/1383-7621(96)00020-3_bib3","author":"Chaudhuri","year":"1992"},{"key":"10.1016\/1383-7621(96)00020-3_bib4","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/0210049","article-title":"Parallel matrix and graph algorithms","volume":"10","author":"Dekel","year":"1981","journal-title":"SIAM J. Computing"},{"key":"10.1016\/1383-7621(96)00020-3_bib5","article-title":"Simultaneous memory access","author":"Eckstein","year":"1979"},{"key":"10.1016\/1383-7621(96)00020-3_bib6","series-title":"Proc. Conf. on Theoretical Computer Science","first-page":"21","article-title":"Parallel graph processing using depth-first search","author":"Eckstein","year":"1977"},{"key":"10.1016\/1383-7621(96)00020-3_bib7","first-page":"9","article-title":"A parallel algorithm for multiple updates of minimum spanning trees","volume":"3","author":"Pawagi","year":"1989"},{"key":"10.1016\/1383-7621(96)00020-3_bib8","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0020-0190(86)90098-0","article-title":"An O(log n) algorithm for parallel update of minimum spanning trees","volume":"22","author":"Pawagi","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/1383-7621(96)00020-3_bib9","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1137\/0207020","article-title":"Parallel computations in graph theory","volume":"2","author":"Reghbati","year":"1978","journal-title":"SIAM J. Computing"},{"key":"10.1016\/1383-7621(96)00020-3_bib10","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(85)90024-9","article-title":"Depth-first search is inherently sequential","volume":"20","author":"Reif","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/1383-7621(96)00020-3_bib11","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0196-6774(86)90040-4","article-title":"An efficient parallel algorithm for shifting the root of a depth first spanning tree","volume":"7","author":"Tiwari","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/1383-7621(96)00020-3_bib12","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0020-0190(88)90020-8","article-title":"On handling vertex deletion in updating minimum spanning trees","volume":"27","author":"Tsin","year":"1988","journal-title":"Inform. Process. Lett."}],"container-title":["Journal of Systems Architecture"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:1383762196000203?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:1383762196000203?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T01:57:40Z","timestamp":1555639060000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/1383762196000203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["1383762196000203"],"URL":"https:\/\/doi.org\/10.1016\/1383-7621(96)00020-3","relation":{},"ISSN":["1383-7621"],"issn-type":[{"value":"1383-7621","type":"print"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}