{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:49:22Z","timestamp":1773931762814,"version":"3.50.1"},"reference-count":9,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"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":["Computer Communications"],"published-print":{"date-parts":[[1996,7]]},"DOI":"10.1016\/s0140-3664(96)01094-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:56:11Z","timestamp":1027652171000},"page":"628-636","source":"Crossref","is-referenced-by-count":11,"title":["Efficient distributed breadth-first search algorithm"],"prefix":"10.1016","volume":"19","author":[{"given":"S.A.M.","family":"Makki","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(96)01094-8_BIB1","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 Eng."},{"key":"10.1016\/S0140-3664(96)01094-8_BIB2","series-title":"Proc. 2nd Symp. of Theoretical Aspects of Computer Science","first-page":"143","article-title":"A single source shortest path algorithm for a planar distributed network","author":"Fredrickson","year":"1985"},{"key":"10.1016\/S0140-3664(96)01094-8_BIB3","series-title":"Proc. 26th IEEE Symposium on Foundations of Computer Science (FOCS)","first-page":"250","article-title":"Distributed BFS algorithms","author":"Awerbuch","year":"1985"},{"key":"10.1016\/S0140-3664(96)01094-8_BIB4","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0020-0255(87)90039-9","article-title":"Algorithms for some graph problems on a distributed computational model","volume":"43","author":"Chaudhuri","year":"1987","journal-title":"Infor. Sciences"},{"key":"10.1016\/S0140-3664(96)01094-8_BIB5","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1109\/TIT.1987.1057314","article-title":"A new distributed algorithm to find Breadth-First Search tree","volume":"33","author":"Awerbuch","year":"1987","journal-title":"IEEE Trans. Info. Theory"},{"key":"10.1016\/S0140-3664(96)01094-8_BIB6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1002\/scj.4690201002","article-title":"An efficient distributed algorithm for constructing a breadth-first search tree","volume":"20","author":"Park","year":"1989","journal-title":"Systems and Computers in Japan"},{"key":"10.1016\/S0140-3664(96)01094-8_BIB7","series-title":"Proc. 21st Annual ACM Symposium on Theory of Computing (STOC)","first-page":"490","article-title":"Distributed shortest paths algorithms","author":"Awerbuch","year":"1989"},{"key":"10.1016\/S0140-3664(96)01094-8_BIB8","series-title":"Proc. 30th IEEE Symposium on Foundations of Computer Science (FOCS)","first-page":"364","article-title":"Network decomposition and locality in distributed computation","author":"Awerbuch","year":"1989"},{"key":"10.1016\/S0140-3664(96)01094-8_BIB9","series-title":"Distance in Graphs","author":"Buckley","year":"1976"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366496010948?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366496010948?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T03:23:25Z","timestamp":1555212205000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366496010948"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":9,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["S0140366496010948"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(96)01094-8","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}