{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:46:19Z","timestamp":1725551179740},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240761"},{"type":"electronic","value":"9783540305361"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30536-1_4","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T23:31:39Z","timestamp":1270078299000},"page":"28-39","source":"Crossref","is-referenced-by-count":0,"title":["Distributed Computation for Swapping a Failing Edge"],"prefix":"10.1007","author":[{"given":"Linda","family":"Pagli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Prencipe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tranos","family":"Zuva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1006\/jagm.1993.1016","volume":"14","author":"Y. Afek","year":"1993","unstructured":"Afek, Y., Ricklin, M.: Sparser: a paradigm for running distributed algorithms. Journal of Algorithms\u00a014, 316\u2013328 (1993)","journal-title":"Journal of Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest Common Ancestor: A survey and a new distributed algorithms. In: 14th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA), pp. 258\u2013264 (2002)","key":"4_CR2","DOI":"10.1145\/564870.564914"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1109\/TIT.1987.1057314","volume":"33","author":"B. Awerbuch","year":"1987","unstructured":"Awerbuch, B., Gallager, R.: A new distributed algorithm to find breadth first search trees. IEEE Transactions on Information Theory\u00a033, 315\u2013322 (1987)","journal-title":"IEEE Transactions on Information Theory"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1145\/358690.358717","volume":"25","author":"K.M. Chandy","year":"1982","unstructured":"Chandy, K.M., Misra, J.: Distributed computation on graphs: shortest path algorithms. Communication of ACM\u00a025, 833\u2013837 (1982)","journal-title":"Communication of ACM"},{"key":"4_CR5","volume-title":"CRC Handbook of Algorithms and Theory","author":"D. Eppstein","year":"1997","unstructured":"Eppstein, D., Galil, Z., Italiano, G.F.: Dynamic graph algorithms. In: CRC Handbook of Algorithms and Theory. CRC Press, Boca Raton (1997)"},{"doi-asserted-by":"crossref","unstructured":"Flocchini, P., Mesa Enriquez, A., Pagli, L., Prencipe, G., Santoro, N.: Efficient protocols for computing the optimal swap edges of a shortest path tree. In: Proc. of 3rd IFIP International Conference on Theoretical Computer Science (TCS@2004), pp. 153\u2013166 (2004)","key":"4_CR6","DOI":"10.1007\/1-4020-8141-3_14"},{"key":"4_CR7","first-page":"151","volume":"17","author":"G.N. Frederikson","year":"1990","unstructured":"Frederikson, G.N.: A distributed shortest path algorithm for planar networks. Computer and Operations Research\u00a017, 151\u2013153 (1990)","journal-title":"Computer and Operations Research"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-540-27796-5_10","volume-title":"Structural Information and Communication Complexity","author":"A. Salvo Di","year":"2004","unstructured":"Di Salvo, A., Proietti, G.: Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor. In: Kralovic, R., S\u00fdkora, O. (eds.) SIROCCO 2004. LNCS, vol.\u00a03104, pp. 99\u2013110. Springer, Heidelberg (2004)"},{"issue":"6","key":"4_CR9","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1109\/26.87189","volume":"39","author":"P. Humblet","year":"1991","unstructured":"Humblet, P.: Another adaptive distributed shortest path algorithm. IEEE\/ACM Transactions on Communications\u00a039(6), 995\u20131003 (1991)","journal-title":"IEEE\/ACM Transactions on Communications"},{"unstructured":"Ito, H., Iwama, K., Okabe, Y., Yoshihiro, T.: Polynomial-time computable backup tables for shortest-path routing. In: Proc. of 10th Colloquium on Structural Information and Communication Complexity (SIROCCO 2003), pp. 163\u2013177 (2003)","key":"4_CR10"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(88)90016-8","volume":"79","author":"A. Itai","year":"1988","unstructured":"Itai, A., Rodeh, M.: The multi-tree approach to reliability in distributed networks. Information and Computation\u00a079, 43\u201359 (1988)","journal-title":"Information and Computation"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/3-540-17179-7_21","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"H. Mohanti","year":"1986","unstructured":"Mohanti, H., Batthacharjee, G.P.: A distributed algorithm for edge-disjoint path problem. In: Nori, K.V. (ed.) FSTTCS 1986. LNCS, vol.\u00a0241, pp. 344\u2013361. Springer, Heidelberg (1986)"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/s00453-002-0988-z","volume":"35","author":"E. Nardelli","year":"2003","unstructured":"Nardelli, E., Proietti, G., Widmayer, P.: Swapping a failing edge of a single source shortest paths tree is good and fast. Algoritmica\u00a035, 56\u201374 (2003)","journal-title":"Algoritmica"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1109\/90.893870","volume":"8","author":"P. Narvaez","year":"2000","unstructured":"Narvaez, P., Siu, K.Y., Teng, H.Y.: New dynamic algorithms for shortest path tree computation. IEEE Transactions on Networking\u00a08, 735\u2013746 (2000)","journal-title":"IEEE Transactions on Networking"},{"key":"4_CR15","volume-title":"Computer Networks: A Systems Approach","author":"L.L. Peterson","year":"2003","unstructured":"Peterson, L.L., Davie, B.S.: Computer Networks: A Systems Approach, 3rd edn. Morgan Kaufmann, San Francisco (2003)","edition":"3"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","first-page":"207","volume-title":"Proc. 3rd Workshop on Algorithm Engineering (WAE 2000)","author":"G. Proietti","year":"2000","unstructured":"Proietti, G.: Dynamic maintenance versus swapping: An experimental study on shortest paths trees. In: Proc. 3rd Workshop on Algorithm Engineering (WAE 2000). LNCS, pp. 207\u2013217. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing - IWDC 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30536-1_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:26:16Z","timestamp":1620012376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30536-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240761","9783540305361"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30536-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}