{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T05:10:19Z","timestamp":1695964219732},"reference-count":7,"publisher":"Wiley","issue":"9","license":[{"start":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T00:00:00Z","timestamp":1174521600000},"content-version":"vor","delay-in-days":4828,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems & Computers in Japan"],"published-print":{"date-parts":[[1994,1]]},"abstract":"Abstract<\/jats:title>This paper presents a distributed algorithm for the single\u2010source shortest\u2010paths problem in a network with nonnegative integral link weights. Its message complexity is \n\n<\/jats:disp-formula>, where n<\/jats:italic> is the number of processors, e<\/jats:italic> is the number of links, and D<\/jats:italic> is the maximum distance from the root. The known shortest\u2010paths algorithm with the distance\u2010dependent message complexity requires O<\/jats:italic>(min(Dn<\/jats:italic> + e, n<\/jats:italic>2<\/jats:sup>)) messages. The algorithm of this paper is more efficient for networks with D<\/jats:italic> = o(n<\/jats:italic>3<\/jats:sup>\/e<\/jats:italic>) and D<\/jats:italic> = \u03c9(e\/n).<\/jats:italic> Moreover, the breadth\u2010first search tree problem is considered.<\/jats:p>","DOI":"10.1002\/scj.4690250905","type":"journal-article","created":{"date-parts":[[2007,7,8]],"date-time":"2007-07-08T03:22:33Z","timestamp":1183864953000},"page":"53-66","source":"Crossref","is-referenced-by-count":1,"title":["A distributed shortest\u2010paths algorithm with distance\u2010dependent message complexities"],"prefix":"10.1002","volume":"25","author":[{"given":"Kouji","family":"Miura","sequence":"first","affiliation":[]},{"given":"Toshimitsu","family":"Masuzawa","sequence":"additional","affiliation":[]},{"given":"Nobuki","family":"Tokura","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,3,22]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","unstructured":"B.AwerbuchandR. G.Gallager.Distributed BFS algorithms Proc. of 26th Symposium of Foundations of Computer Science pp.250\u2013256(1985).","DOI":"10.1109\/SFCS.1985.20"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057314"},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","unstructured":"B.Awerbuch.Distributed shortest paths algorithms Proc. of 21st Symposium on Theory of Computing pp.490\u2013500(1989).","DOI":"10.1145\/73007.73054"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","unstructured":"G. N.Frederickson.A single source shortest\u2010path algorithm for a planar distributed network Proc. of 2nd Symposium on Theoretical Aspects of Computer Science (LNCS 182) pp.143\u2013150(Jan.1985).","DOI":"10.1007\/BFb0024003"},{"issue":"1","key":"e_1_2_1_6_2","first-page":"33","article-title":"Distributed algorithms to update shortest\u2010path trees","volume":"77","author":"Miura K.","year":"1994","journal-title":"Trans. I.E.I.C.E."},{"issue":"7","key":"e_1_2_1_7_2","first-page":"1176","article-title":"An efficient distributed algorithm for constructing a breadth\u2010first search tree","volume":"71","author":"Park J.","year":"1988","journal-title":"Trans. I.E.I.C.E."},{"issue":"10","key":"e_1_2_1_8_2","first-page":"802","article-title":"Efficient distributed algorithm to solve updating minimum spanning tree problem","volume":"73","author":"Park J.","year":"1990","journal-title":"Trans. I.E.I.C.E."}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690250905","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690250905","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T11:48:21Z","timestamp":1695901701000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690250905"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":7,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["10.1002\/scj.4690250905"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690250905","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}