{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:38Z","timestamp":1763468138530},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382321"},{"type":"electronic","value":"9783642382338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38233-8_11","type":"book-chapter","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T08:57:16Z","timestamp":1368608236000},"page":"122-133","source":"Crossref","is-referenced-by-count":3,"title":["Linear Time Distributed Swap Edge Algorithms"],"prefix":"10.1007","author":[{"given":"Ajoy K.","family":"Datta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence L.","family":"Larmore","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"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-15155-2_14","volume-title":"Mathematical Foundations of Computer Science 2010","author":"D. Bil\u00f2","year":"2010","unstructured":"Bil\u00f2, D., Gual\u00e0, L., Proietti, G.: Finding best swap edges minimizing the routing cost of a spanning tree. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 138\u2013149. Springer, Heidelberg (2010)"},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TDSC.2009.17","volume":"8","author":"B. Gfeller","year":"2011","unstructured":"Gfeller, B., Santoro, N., Widmayer, P.: A distributed algorithm for finding all best swap edges of a minimum diameter spanning tree. IEEE Trans. on Dependable and Secure Comp.\u00a08(1), 1\u201312 (2011)","journal-title":"IEEE Trans. on Dependable and Secure Comp."},{"issue":"1","key":"11_CR3","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. Algorithmica\u00a035(1), 56\u201374 (2003)","journal-title":"Algorithmica"},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s00453-004-1099-9","volume":"40","author":"E. Nardelli","year":"2004","unstructured":"Nardelli, E., Proietti, G., Widmayer, P.: Nearly linear time minimum spanning tree maintenance for transient node failures. Algorithmica\u00a040(1), 119\u2013132 (2004)","journal-title":"Algorithmica"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2007.03.046","volume":"383","author":"A.D. Salvo","year":"2007","unstructured":"Salvo, A.D., Proietti, G.: Swapping a failing edge of a shortest paths tree by minimizing the stretch factor. Theoretical Computer Science\u00a0383(1), 23\u201333 (2007)","journal-title":"Theoretical Computer Science"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1007\/978-3-540-92182-0_63","volume-title":"Algorithms and Computation","author":"S. Das","year":"2008","unstructured":"Das, S., Gfeller, B., Widmayer, P.: Computing best swaps in optimal tree spanners. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 716\u2013727. Springer, Heidelberg (2008)"},{"issue":"2","key":"11_CR7","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1093\/ietisy\/e89-d.2.700","volume":"89-D","author":"P. Flocchini","year":"2006","unstructured":"Flocchini, P., Enriques, A.M., Pagli, L., Prencipe, G., Santoro, N.: Point-of-failure shortest-path rerouting: Computing the optimal swap edges distributively. IEICE Transactions\u00a089-D(2), 700\u2013708 (2006)","journal-title":"IEICE Transactions"},{"issue":"3","key":"11_CR8","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1109\/TC.2010.228","volume":"61","author":"P. Flocchini","year":"2012","unstructured":"Flocchini, P., Pagli, A.M.E.L., Prencipe, G., Santoro, N.: Distributed minumum spanning tree maintenance for transient node failures. IEEE Trans. on Comp.\u00a061(3), 408\u2013414 (2012)","journal-title":"IEEE Trans. on Comp."},{"issue":"7","key":"11_CR9","doi-asserted-by":"publisher","first-page":"976","DOI":"10.1016\/j.jpdc.2008.03.002","volume":"68","author":"P. Flocchini","year":"2008","unstructured":"Flocchini, P., Pagli, L., Prencipe, G., Santoro, N., Widmayer, P.: Computing all the best swap edges distributively. J. Parallel Distrib. Comput.\u00a068(7), 976\u2013983 (2008)","journal-title":"J. Parallel Distrib. Comput."},{"key":"11_CR10","series-title":"LNCS","first-page":"365","volume-title":"OPODIS 2009","author":"L. Pagli","year":"2009","unstructured":"Pagli, L., Prencipe, G.: Brief annoucement: Distributed swap edges computation for minimum routing cost spanning trees. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) OPODIS 2009. LNCS, vol.\u00a05923, pp. 365\u2013371. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38233-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T21:51:51Z","timestamp":1557697911000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38233-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382321","9783642382338"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38233-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}