{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:00:24Z","timestamp":1725494424208},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648482"},{"type":"electronic","value":"9783540685302"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-68530-8_5","type":"book-chapter","created":{"date-parts":[[2007,11,8]],"date-time":"2007-11-08T22:14:16Z","timestamp":1194560056000},"page":"55-66","source":"Crossref","is-referenced-by-count":3,"title":["Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge 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":[[2002,3,15]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"S. Alstrup, J. Holm, K. de Lichtenberg and M. Thorup, Minimizing diameters of dynamic trees, Proc. 24th Int. Coll. on Automata, Languages and Programming (ICALP), (1997) 270\u2013280.","DOI":"10.1007\/3-540-63165-8_184"},{"key":"5_CR2","unstructured":"D. Eppstein, Z. Galil and G.F. Italiano, Dynamic graph algorithms, Tech. Rep. CS96-11, Univ. Ca\u2019 Foscari di Venezia (1996)."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1137\/0214055","volume":"14","author":"G.N. Frederickson","year":"1985","unstructured":"G.N. Frederickson, Data structures for on-line updating of minimum spanning trees, SIAM J. Computing, 14 (1985) 781\u2013798.","journal-title":"SIAM J. Computing"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"G.N. Frederickson, Ambivalent data structures for dynamic 2-edge connectivity and k smallest spanning trees. Proc. 32nd IEEE Symp. on Foundations of Computer Science (FOCS), (1991) 632\u2013641.","DOI":"10.1109\/SFCS.1991.185429"},{"key":"5_CR5","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"},{"key":"5_CR6","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"G.F. Italiano and R. Ramaswami, Maintaining spanning trees of small diameter, Proc. 21st Int. Coll. on Automata, Languages and Programming (ICALP), (1994) 212\u2013223. A revised version will appear in Algorithmica.","DOI":"10.1007\/3-540-58201-0_71"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0020-0190(93)90082-K","volume":"48","author":"K. Iwano","year":"1993","unstructured":"K. Iwano and N. Katoh, Efficient algorithms for finding the most vital edge of a minimum spanning tree, Info. Proc. Letters, 48 (1993) 211\u2013213.","journal-title":"Info. Proc. Letters"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0167-6377(89)90065-5","volume":"8","author":"K. Malik","year":"1989","unstructured":"K. Malik, A.K. Mittal and S.K. Gupta, The k most vital arcs in the shortest path problem, Oper. Res. Letters, 8 (1989) 223\u2013227.","journal-title":"Oper. Res. Letters"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"E. Nardelli, G. Proietti and P. Widmayer, Finding the detour-critical edge of a shortest path between two nodes, Info. Proc. Letters, to appear.","DOI":"10.1016\/S0020-0190(98)00077-5"},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/62.2160","volume":"31","author":"R.E. Tarjan","year":"1984","unstructured":"R.E. Tarjan and J. van Leeuwen, Worst-case analysis of set union algorithms, JACM, 31(2) (1984) 245\u2013281.","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA\u2019 98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68530-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T08:28:21Z","timestamp":1556958501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68530-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648482","9783540685302"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-68530-8_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}