{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:06:12Z","timestamp":1757541972363},"reference-count":6,"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)90228-6","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T01:00:31Z","timestamp":1049504431000},"page":"103-109","source":"Crossref","is-referenced-by-count":30,"title":["A time-optimal message-efficient distributed algorithm for depth-first-search"],"prefix":"10.1016","volume":"25","author":[{"given":"K.B.","family":"Lakshmanan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Meenakshi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Thulasiraman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0020-0190(87)90228-6_BIB1","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(85)90083-3","article-title":"A new distributed depth-first-search algorithm","volume":"20","author":"Awerbuch","year":"1985","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"10.1016\/0020-0190(87)90228-6_BIB2","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1109\/TSE.1982.235573","article-title":"Echo algorithms: Depth parallel operations on general graphs","volume":"SE-8","author":"Chang","year":"1982","journal-title":"IEEE Trans. Software Engrg."},{"issue":"4","key":"10.1016\/0020-0190(87)90228-6_BIB3","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1109\/TSE.1983.234958","article-title":"Graph traversal techniques and the maximum flow problem in distributed computation","volume":"SE-9","author":"Cheung","year":"1983","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0020-0190(87)90228-6_BIB4","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"issue":"1","key":"10.1016\/0020-0190(87)90228-6_BIB5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/TIT.1983.1056620","article-title":"Distributed network protocols","author":"Segall","year":"1983","journal-title":"IEEE Trans. Inform. Theory IT-29"},{"key":"10.1016\/0020-0190(87)90228-6_BIB6","series-title":"Graphs, Networks and Algorithms","author":"Swamy","year":"1981"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087902286?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087902286?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T05:26:27Z","timestamp":1553405187000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019087902286"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,5]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,5]]}},"alternative-id":["0020019087902286"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(87)90228-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1987,5]]}}}