{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:38:54Z","timestamp":1742974734522,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540273240"},{"type":"electronic","value":"9783540315841"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11516798_11","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T04:29:05Z","timestamp":1279081745000},"page":"154-168","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computing All the Best Swap Edges Distributively"],"prefix":"10.1007","author":[{"given":"P.","family":"Flocchini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Pagli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Prencipe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Santoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Widmayer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Zuva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,8,23]]},"reference":[{"key":"11_CR1","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)"},{"key":"11_CR2","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)"},{"key":"11_CR3","unstructured":"Flocchini, P., Mesa, T., Pagli, L., Prencipe, G., Santoro, N.: Efficient protocols for computing optimal swap edges. In: Proc. of 3rd IFIP International Conference on Theoretical Computer Science (TCS 2004) (2004) (to appear)"},{"key":"11_CR4","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":"11_CR5","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":"11_CR6","doi-asserted-by":"crossref","unstructured":"Mohanty, H., Bhattacharjee, G.P.: A distributed algorithm for edge-disjoint path problem. In: Proc. of 6th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp. 344\u2013361 (1986)","DOI":"10.1007\/3-540-17179-7_21"},{"issue":"1","key":"11_CR7","first-page":"1","volume":"2","author":"E. Nardelli","year":"1997","unstructured":"Nardelli, E., Proietti, G., Widmayer, P.: Finding all the best swaps of a minimum diameter spanning tree under transient edge failures. Journal of Graph Algorithms and Applications\u00a02(1), 1\u201323 (1997)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"11_CR8","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":"11_CR9","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":"11_CR10","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":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-44691-5_18","volume-title":"Algorithm Engineering","author":"G. Proietti","year":"2001","unstructured":"Proietti, G.: Dynamic maintenance versus swapping: An experimental study on shortest paths trees. In: N\u00e4her, S., Wagner, D. (eds.) WAE 2000. LNCS, vol.\u00a01982, pp. 207\u2013217. Springer, Heidelberg (2001)"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1145\/322154.322161","volume":"26","author":"R.E. Tarjan","year":"1979","unstructured":"Tarjan, R.E.: Application of path compression on balanced trees. Journal of ACM\u00a026, 690\u2013715 (1979)","journal-title":"Journal of ACM"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11516798_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T21:05:10Z","timestamp":1585688710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11516798_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540273240","9783540315841"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11516798_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]},"assertion":[{"value":"23 August 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}