{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T05:44:07Z","timestamp":1738129447784,"version":"3.33.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1007\/bf02835831","type":"journal-article","created":{"date-parts":[[2008,2,14]],"date-time":"2008-02-14T07:28:20Z","timestamp":1202974100000},"page":"93-122","source":"Crossref","is-referenced-by-count":1,"title":["Efficient distributed algorithms for single-source shortest paths and related problems on plane networks"],"prefix":"10.1007","volume":"25","author":[{"given":"Ravi","family":"Janardan","sequence":"first","affiliation":[]},{"given":"Siu Wing","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02835831_CR1","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"[A1] B. Awerbuch, Complexity of network synchronization,Journal of the Association for Computing Machinery,32 (1985), 804\u2013823.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"BF02835831_CR2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(85)90083-3","volume":"20","author":"B. Awerbuch","year":"1985","unstructured":"[A2] B. Awerbuch, A new distributed depth-first search algorithm,Information Processing Letters,20 (1985), 147\u2013150.","journal-title":"Information Processing Letters"},{"key":"BF02835831_CR3","doi-asserted-by":"crossref","unstructured":"[A3] B. Awerbuch, Distributed shortest paths algorithms,Proc. 21st ACM Symposium on Theory of Computing, Seattle, WA, May 1989, pp. 490\u2013500.","DOI":"10.1145\/73007.73054"},{"key":"BF02835831_CR4","doi-asserted-by":"crossref","unstructured":"[ABLP] B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg, Compact distributed data structures for adaptive routing,Proc. 21st ACM Symposium on Theory of Computing, Seattle, WA, May 1989, pp. 479\u2013489.","DOI":"10.1145\/73007.73053"},{"key":"BF02835831_CR5","doi-asserted-by":"crossref","unstructured":"[AG1] B. Awerguch and R. Gallager, Distributed BFS algorithms,Proc. 26th IEEE Symposium on Foundations of Computer Science, Portland, OR, October 1985, pp. 250\u2013256.","DOI":"10.1109\/SFCS.1985.20"},{"key":"BF02835831_CR6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1109\/TIT.1987.1057314","volume":"33","author":"B. Awerbuch","year":"1987","unstructured":"[AG2] B. Awerbuch and R. Gallager, A new distributed algorithm to find breadth-first search trees,IEEE Transactions on Information Theory,33 (1987), 315\u2013322.","journal-title":"IEEE Transactions on Information Theory"},{"key":"BF02835831_CR7","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1137\/0217004","volume":"17","author":"D. Bienstock","year":"1988","unstructured":"[BM] D. Bienstock and C. Monma, On the complexity of covering vertices by faces in a planar graph,SIAM Journal on Computing,17 (1988), 53\u201376.","journal-title":"SIAM Journal on Computing"},{"key":"BF02835831_CR8","doi-asserted-by":"crossref","unstructured":"[F1] G. Frederickson, A single source shortest path algorithm for a planar distributed network,Proc. 2nd Symposium on Theoretical Aspects of Computer Science, 1985, pp. 143\u2013150.","DOI":"10.1007\/BFb0024003"},{"key":"BF02835831_CR9","doi-asserted-by":"crossref","unstructured":"[F2] G. Frederickson, A new approach to all pairs shortest paths in planar graphs,Proc. 19th ACM Symposium on Theory of Computing, New York, May 1987, pp. 19\u201328. Revised version available as: Planar Graph Decomposition and All Pairs Shortest Paths, TR-89-015, ICSI, Berkeley, March 1989.","DOI":"10.1145\/28395.28398"},{"key":"BF02835831_CR10","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01762113","volume":"3","author":"G. Frederickson","year":"1988","unstructured":"[FJ1] G. Frederickson and R. Janardan, Designing networks with compact routing tables,Algorithmica,3 (1988), 171\u2013190.","journal-title":"Algorithmica"},{"key":"BF02835831_CR11","doi-asserted-by":"crossref","first-page":"1529","DOI":"10.1109\/12.9731","volume":"37","author":"G. Frederickson","year":"1988","unstructured":"[FJ2] G. Frederickson and R. Janardan, Space-efficient and fault-tolerant message routing in outerplanar networks,IEEE Transactions on Computers,37 (1988), 1529\u20131540.","journal-title":"IEEE Transactions on Computers"},{"key":"BF02835831_CR12","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1109\/TCOM.1980.1094690","volume":"28","author":"M. Schwartz","year":"1980","unstructured":"[SS] M. Schwartz and T. Stern, Routing techniques used in computer communication networks,IEEE Transactions on Communications,28 (1980), 539\u2013552.","journal-title":"IEEE Transactions on Communications"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02835831.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02835831\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02835831","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,28]],"date-time":"2025-01-28T15:39:20Z","timestamp":1738078760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02835831"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["BF02835831"],"URL":"https:\/\/doi.org\/10.1007\/bf02835831","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"type":"print","value":"0025-5661"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}