{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T17:54:31Z","timestamp":1717178071566},"reference-count":9,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"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":[[2002,5]]},"DOI":"10.1016\/s0020-0190(01)00273-3","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T17:55:05Z","timestamp":1034618105000},"page":"173-178","source":"Crossref","is-referenced-by-count":18,"title":["Some remarks on distributed depth-first search"],"prefix":"10.1016","volume":"82","author":[{"given":"Y.H","family":"Tsin","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0020-0190(01)00273-3_BIB001","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\/S0020-0190(01)00273-3_BIB002","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":"9","author":"Cheung","year":"1983","journal-title":"IEEE Trans. Software Engrg."},{"issue":"6","key":"10.1016\/S0020-0190(01)00273-3_BIB003","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0020-0190(88)90187-1","article-title":"Yet another distributed depth-first search algorithm","volume":"26","author":"Cidon","year":"1988","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"10.1016\/S0020-0190(01)00273-3_BIB004","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0020-0190(90)90175-W","article-title":"Correction to a distributed depth-first-search algorithm","volume":"35","author":"Kumar","year":"1990","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/S0020-0190(01)00273-3_BIB005","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/S0020-0190(96)00141-X","article-title":"Distributed algorithms for depth-first search","volume":"60","author":"Makki","year":"1996","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/S0020-0190(01)00273-3_BIB006","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0020-0190(87)90228-6","article-title":"A time-optimal message-efficient distributed algorithm for depth-first search","volume":"25","author":"Lakshmanan","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(01)00273-3_BIB007","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."},{"issue":"4","key":"10.1016\/S0020-0190(01)00273-3_BIB008","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(89)90041-0","article-title":"An efficient distributed depth-first-search algorithm","volume":"32","author":"Sharma","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(01)00273-3_BIB009","series-title":"Introduction to Distributed Algorithms","author":"Tel","year":"1994"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002733?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002733?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T13:26:48Z","timestamp":1555766808000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002733"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0020019001002733"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00273-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}