{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T13:28:46Z","timestamp":1762781326481,"version":"3.32.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540552367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022448","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:03:27Z","timestamp":1131861807000},"page":"200-211","source":"Crossref","is-referenced-by-count":7,"title":["Distributed algorithms for updating shortest paths"],"prefix":"10.1007","author":[{"given":"Giuseppe F.","family":"Italiano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Y. Afek, B. Awerbuch, and E. Gafni. Applying static network protocols to dynamic networks. In Proc. 28th Annual IEEE Symp. on Foundations of Computer Science, pages 358\u2013370, 1987.","DOI":"10.1109\/SFCS.1987.7"},{"key":"15_CR2","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"G. Ausiello, G. F. Italiano, A. Marchetti Spaccamela, and U. Nanni. Incremental algorithms for minimal length paths. In Proc. 1st Annual ACM-SIAM Symp. on Discrete Algorithms, pages 12\u201321, 1990. A journal version to appear in J. Algorithms.","DOI":"10.1016\/0196-6774(91)90036-X"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"B. Awerbuch. On the effects of feedback in dynamic network protocols. In Proc. 29th Annual IEEE Symp. on Foundations of Computer Science, pages 231\u2013245, 1988.","DOI":"10.1109\/SFCS.1988.21940"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"B. Awerbuch. Distributed shortest paths algorithms. In Proc. 21st Annual ACM Symp. on Theory of Computing, pages 490\u2013500, 1989.","DOI":"10.1145\/73007.73054"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, I. Cidon, and S. Kutten. Communication-optimal maintainance of replicated information. In Proc. 31st Annual IEEE Symp. on Foundations of Computer Science, pages 492\u2013502, 1990.","DOI":"10.1109\/FSCS.1990.89570"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"B. Awerbuch and M. Sipser. Dynamic networks are as fast as static networks. In Proc. 29th Annual IEEE Symp. on Foundations of Computer Science, pages 206\u2013219, 1988.","DOI":"10.1109\/SFCS.1988.21938"},{"key":"15_CR8","unstructured":"E. Gafni. Topology resynchronization: a new paradigm for fault tolerance in distributed algorithms. In Proc. of the Amsterdam Workshop on Distributed Algorithms, 1987."},{"key":"15_CR9","unstructured":"R. G. Gallager. A shortest path routing algorithm with automatic resynch. Technical report, MIT, Lab. for Information and Decision Systems, 1976."},{"key":"15_CR10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/TCOM.1977.1093711","volume":"COM-25","author":"R. G. Gallager","year":"1977","unstructured":"R. G. Gallager. An optimal routing algorithm using distributed computation. IEEE Trans, on Commun., COM-25:73\u201385, 1977.","journal-title":"IEEE Trans, on Commun."},{"key":"15_CR11","doi-asserted-by":"crossref","first-page":"1758","DOI":"10.1109\/TCOM.1982.1095632","volume":"COM-30","author":"J. Jaffe","year":"1982","unstructured":"J. Jaffe and F. Moss. A responsive distributed routing protocol. IEEE Trans, on Commun., COM-30:1758\u20131762, 1982.","journal-title":"IEEE Trans, on Commun"},{"key":"15_CR12","unstructured":"K. V. S. Ramarao and S. Venkatesan. On finding and updating shortest paths. In Proc. 24th Annual Allerton Conf. on Communication, Control and Computing, pages 1079\u20131988, 1986."},{"key":"15_CR13","volume-title":"Computer networks","author":"A. S. Tanenbaum","year":"1981","unstructured":"A. S. Tanenbaum. Computer networks. Prentice-Hall, Englewood Cliffs, NJ, 1981."},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"R. E. Tarjan. Data structures and network algorithms, volume 44. CBMS-NSF Regional Conference Series in Applied Mathematics, SIAM, 1983.","DOI":"10.1137\/1.9781611970265"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022448.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T12:59:47Z","timestamp":1736081987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022448"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540552367"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0022448","relation":{},"subject":[]}}