{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:03:21Z","timestamp":1725487401033},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662006"},{"type":"electronic","value":"9783540486862"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999]]},"DOI":"10.1007\/3-540-48686-0_14","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:54:12Z","timestamp":1184601252000},"page":"144-153","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["How to Swap a Failing Edge of a Single Source Shortest Paths Tree"],"prefix":"10.1007","author":[{"given":"Enrico","family":"Nardelli","sequence":"first","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,6,25]]},"reference":[{"key":"14_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R.K. Ahuia","year":"1993","unstructured":"R.K. Ahuia, T.L. Magnanti and J.B Orlin. Network Flows: Theory, Algorithms and Applications, Prentice Hall, Englewood Cliffs, NJ (1993)."},{"key":"14_CR2","unstructured":"A. Bar-Noy, S. Khuller and B. Schieber, The complexity of finding most vital arcs and nodes, CS-TR-3539, Dept. of Computer Science, Univ. of Maryland, 1995."},{"key":"14_CR3","unstructured":"D. Frigioni, A. Marchetti-Spaccamela and U. Nanni, Fully dynamic output bounded single source shortest path problem, in Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA'96), 1996, 212\u2013221."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/S0927-0507(05)80127-6","volume":"7","author":"M. Gr\u00f6tschel","year":"1995","unstructured":"M. Gr\u00f6tschel, C.L. Monma and M. Stoer, Design of survivable networks, in: Handbooks in OR and MS, Vol. 7, Elsevier (1995) 617\u2013672.","journal-title":"Handbooks in OR and MS"},{"issue":"2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"D. Harel and R.E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comput., 13(2) (1984) 338\u2013355.","journal-title":"SIAM J. Comput."},{"key":"14_CR6","series-title":"Lect Notes Comput Sci","first-page":"212","volume-title":"Proc. 21st Int. Coll. on Automata, Languages and Programming (ICALP'94)","author":"G.F. Italiano","year":"1994","unstructured":"G.F. Italiano and R. Ramaswami, Maintaining spanning trees of small diameter, Proc. 21st Int. Coll. on Automata, Languages and Programming (ICALP'94), 1994, Lecture Notes in Computer Science, Vol. 820, 212\u2013223."},{"key":"14_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/3-540-68530-8_5","volume-title":"Proc. 6th European Symp. on Algorithms (ESA'98)","author":"E. Nardelli","year":"1998","unstructured":"E. Nardelli, G. Proietti and P. Widmayer, Finding all the best swaps of a minimum diameter spanning tree under transient edge failures, Proc. 6th European Symp. on Algorithms (ESA'98), 1998, Lecture Notes in Computer Science, Vol. 1461, 55\u201366."},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R.E. Tarjan","year":"1975","unstructured":"R.E. Tarjan, Efficiency of a good but not linear set union algorithm, Journal of the ACM, 22 (1975) 215\u2013225.","journal-title":"Journal of the ACM"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1145\/322154.322161","volume":"26","author":"R.E. Tarjan","year":"1979","unstructured":"R.E. Tarjan, Applications of path compression on balanced trees, Journal of the ACM, 26 (1979) 690\u2013715.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48686-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T23:46:32Z","timestamp":1558482392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48686-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662006","9783540486862"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-48686-0_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"25 June 1999","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}