{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:27:22Z","timestamp":1725460042575},"publisher-location":"Boston","reference-count":10,"publisher":"Kluwer Academic Publishers","isbn-type":[{"type":"print","value":"1402081405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/1-4020-8141-3_14","type":"book-chapter","created":{"date-parts":[[2006,2,21]],"date-time":"2006-02-21T15:15:11Z","timestamp":1140534911000},"page":"153-166","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree"],"prefix":"10.1007","author":[{"given":"Paola","family":"Flocchini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio Mesa","family":"Enriques","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linda","family":"Pagli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Prencipe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1006\/jagm.1993.1016","volume":"14","author":"Y. Afek","year":"1993","unstructured":"Y. Afek, M. Ricklin Sparser: a paradigm for running distributed algorithms. Journal of Algorithms, 14:316\u2013328, 1993.","journal-title":"Journal of Algorithms"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1109\/TIT.1987.1057314","volume":"33","author":"B. Awerbuch","year":"1987","unstructured":"B. Awerbuch, R. Gallager A new distributed algorithm to find breadth first search trees. IEEE Transactions on Information Theory, 33:315\u2013322, 1987.","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR3","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1145\/358690.358717","volume":"25","author":"K. M. Chandy","year":"1982","unstructured":"K. M. Chandy, J. Misra Distributed computation on graphs: shortest path algorithms. Comunication of ACM, 25:833\u2013837, 1982.","journal-title":"Comunication of ACM"},{"key":"14_CR4","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/0890-5401(90)90051-I","volume":"86","author":"G. N. Frederikson","year":"1990","unstructured":"G. N. Frederikson A distributed shortest path algorithm for planar networks. Information and Computation, 86:140\u2013159, 1990.","journal-title":"Information and Computation"},{"issue":"6","key":"14_CR5","doi-asserted-by":"crossref","first-page":"995","DOI":"10.1109\/26.87189","volume":"39","author":"P. Humblet","year":"1991","unstructured":"P. Humblet. Another adaptive distributed shortest path algorithm. IEEE\/ACM Transactions on Communications, 39(6):995\u20131003, 1991.","journal-title":"IEEE\/ACM Transactions on Communications"},{"key":"14_CR6","unstructured":"H. Ito, K. Iwama, Y. Okabe, T. Yoshihiro Polynomial-time computable backup tables for shortest-path routing. Proc. of 10th Colloquium on Structural Information and Communication Complexity (SIROCCO 2003), 163\u2013177, 2003."},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1109\/90.893870","volume":"8","author":"P. Narvaez","year":"2000","unstructured":"P. Narvaez, K. Y. Siu, H.Y. Teng New dynamic algorithms for shortest path tree computation IEEE Transactions on Networking, 8:735\u2013746, 2000.","journal-title":"IEEE Transactions on Networking"},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/s00453-002-0988-z","volume":"35","author":"E. Nardelli","year":"2003","unstructured":"E. Nardelli, G. Proietti, P. Widmayer Swapping a failing edge of a single source shortest paths tree is good and fast. Algoritmica, 35:56\u201374, 2003.","journal-title":"Algoritmica"},{"key":"14_CR9","unstructured":"L. L. Peterson, B. S. Davie. Computer Networks: A Systems Approach, 3rd Edition. Morgan Kaufmann,2003."},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1145\/322154.322161","volume":"26","author":"R. E. Tarjan","year":"1979","unstructured":"R. E. Tarjan Application of path compression on balanced trees. Journal of ACM, 26:690\u2013715, 1979.","journal-title":"Journal of ACM"}],"container-title":["IFIP International Federation for Information Processing","Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/1-4020-8141-3_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:28:07Z","timestamp":1619555287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/1-4020-8141-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["1402081405"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/1-4020-8141-3_14","relation":{},"subject":[]}}