{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:04:12Z","timestamp":1725494652550},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410041"},{"type":"electronic","value":"9783540452539"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45253-2_32","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T16:06:25Z","timestamp":1194969985000},"page":"346-355","source":"Crossref","is-referenced-by-count":5,"title":["Maintaining a Minimum Spanning Tree under Transient Node Failures"],"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":[[2003,2,11]]},"reference":[{"key":"32_CR1","volume-title":"TR NECI 99-099","author":"B. Chazelle","year":"1999","unstructured":"B. Chazelle, A minimum spanning tree algorithm with inverse-Ackermann time complexity, TR NECI 99-099, Princeton University, NJ, 1999."},{"issue":"3","key":"32_CR2","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0022-0000(78)90022-3","volume":"16","author":"F. Chin","year":"1978","unstructured":"F. Chin and D. Houck, Algorithms for updating minimal spanning trees, J. Comput. System Sci., 16(3) 1978 333\u2013344.","journal-title":"J. Comput. System Sci."},{"key":"32_CR3","unstructured":"B. Das and M.C. Loui, Reconstructing a minimum spanning tree after deletion of any node, TR UILU-ENG-95-2241 (ACT-136), University of Illinois at Urbana-Champaign, IL, 1995."},{"issue":"6","key":"32_CR4","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1137\/0221070","volume":"21","author":"B. Dixon","year":"1992","unstructured":"B. Dixon, M. Rauch and R.E. Tarjan, Verification and sensitivity analysis of minimum spanning trees in linear time, SIAM J. Comput., 21(6) 1992 1184\u20131192.","journal-title":"SIAM J. Comput."},{"key":"32_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/BFb0028278","volume-title":"2nd Workshop on Algorithms and Data Structures (WADS\u201991)","author":"D. Eppstein","year":"1991","unstructured":"D. Eppstein, Offline algorithms for dynamic minimum spanning tree problem, 2nd Workshop on Algorithms and Data Structures (WADS\u201991), Ottawa, Canada, 1991, Vol. 519 of Lecture Notes in Computer Science, Springer-Verlag, 392\u2013399. A revised version appeared in J. of Algorithms, 17(2) (1994) 237\u2013250."},{"issue":"3","key":"32_CR6","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"M.L. Fredman and R.E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J. of the ACM, 34(3) 1987 596\u2013615.","journal-title":"J. of the ACM"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, C.L. Monma and M. Stoer, Design of survivable networks, Handbooks in OR and MS, Vol. 7, Elsevier 1995 617\u2013672.","DOI":"10.1016\/S0927-0507(05)80127-6"},{"issue":"3","key":"32_CR8","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/PL00009225","volume":"22","author":"G.F. Italiano","year":"1998","unstructured":"G.F. Italiano and R. Ramaswami, Maintaining spanning trees of small diameter, Algorithmica 22(3) 1998 275\u2013304.","journal-title":"Algorithmica"},{"key":"32_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/3-540-68530-8_5","volume-title":"6th European Symp. on Algorithms (ESA\u2019 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, 6th European Symp. on Algorithms (ESA\u2019 98), Venice, Italy, 1998, Vol. 1461 of Lecture Notes in Computer Science, Springer-Verlag, 55\u201366."},{"key":"32_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-48686-0_14","volume-title":"5th Annual Int. Computing and Combinatorics Conf. (COCOON\u201999)","author":"E. Nardelli","year":"1999","unstructured":"E. Nardelli, G. Proietti and P. Widmayer, How to swap a failing edge of a single source shortest paths tree, 5th Annual Int. Computing and Combinatorics Conf. (COCOON\u201999), Tokyo, Japan, 1999, Vol. 1627 of Lecture Notes in Computer Science, Springer-Verlag, 144\u2013153."},{"issue":"1","key":"32_CR11","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1137\/0215004","volume":"15","author":"D.D. Sleator","year":"1986","unstructured":"D.D. Sleator and R.E. Tarjan, Self-Adjusting Heaps, SIAM J. Comput., 15(1) (1986) 52\u201369.","journal-title":"SIAM J. Comput."},{"issue":"2","key":"32_CR12","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, J. of the ACM, 22(2) 1975 215\u2013225.","journal-title":"J. of the ACM"},{"issue":"4","key":"32_CR13","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, J. of the ACM, 26(4) 1979 690\u2013715.","journal-title":"J. of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45253-2_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T06:51:23Z","timestamp":1556952683000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45253-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410041","9783540452539"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45253-2_32","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}