{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T00:32:53Z","timestamp":1794357173530,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":15,"publisher":"Springer US","isbn-type":[{"value":"9780387307701","type":"print"},{"value":"9780387301624","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_156","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T14:35:59Z","timestamp":1214490959000},"page":"339-342","source":"Crossref","is-referenced-by-count":0,"title":["Fully Dynamic Minimum Spanning Trees"],"prefix":"10.1007","author":[{"given":"Giuseppe F.","family":"Italiano","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"156_CR1_156","doi-asserted-by":"crossref","unstructured":"Alberts, D., Cattaneo, G., Italiano, G.F.: An empirical study of dynamic graph algorithms. ACM. J.\u00a0Exp. Algorithm 2, (1997)","DOI":"10.1145\/264216.264223"},{"key":"156_CR2_156","doi-asserted-by":"crossref","unstructured":"Cattaneo, G., Faruolo, P., Ferraro Petrillo, U., Italiano, G.F.: Maintaining Dynamic Minimum Spanning Trees: An Experimental Study. In: Proceeding 4th Workshop on Algorithm Engineering and Experiments (ALENEX 02), 6\u20138 Jan 2002. pp.\u00a0111\u2013125","DOI":"10.1007\/3-540-45643-0_9"},{"key":"156_CR3_156","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF01994879","volume":"32","author":"D. Eppstein","year":"1992","unstructured":"Eppstein, D.: Finding the k smallest spanning trees. BIT. 32, 237\u2013248 (1992)","journal-title":"BIT."},{"key":"156_CR4_156","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1142\/S0218195994000136","volume":"4","author":"D. Eppstein","year":"1994","unstructured":"Eppstein, D.: Tree-weighted neighbors and geometric k smallest spanning trees. Int. J.\u00a0Comput. Geom. Appl. 4, 229\u2013238 (1994)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"5","key":"156_CR5_156","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1145\/265910.265914","volume":"44","author":"D. Eppstein","year":"1997","unstructured":"Eppstein, D., Galil, Z., Italiano, G.F., Nissenzweig, A.: Sparsification\u00a0\u2013 a\u00a0technique for speeding up dynamic graph algorithms. J.\u00a0Assoc. Comput. Mach. 44(5), 669\u2013696 (1997)","journal-title":"J. Assoc. Comput. Mach."},{"key":"156_CR6_156","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0196-6774(92)90004-V","volume":"13","author":"D. Eppstein","year":"1992","unstructured":"Eppstein, D., Italiano, G.F., Tamassia, R., Tarjan, R.E., Westbrook, J., Yung, M.: Maintenance of a\u00a0minimum spanning forest in a\u00a0dynamic plane graph. J.\u00a0Algorithms 13, 33\u201354 (1992)","journal-title":"J. Algorithms"},{"key":"156_CR7_156","doi-asserted-by":"crossref","unstructured":"Feder, T., Mihail, M.: Balanced matroids. In: Proceeding 24th ACM Symp. Theory of Computing, pp\u00a026\u201338, Victoria, British Columbia, Canada, May 04\u201306 1992","DOI":"10.1145\/129712.129716"},{"key":"156_CR8_156","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1137\/0214055","volume":"14","author":"G.N. Frederickson","year":"1985","unstructured":"Frederickson, G.N.: Data structures for on-line updating of minimum spanning trees. SIAM. J.\u00a0Comput. 14, 781\u2013798 (1985)","journal-title":"SIAM. J. Comput."},{"issue":"2","key":"156_CR9_156","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1137\/S0097539792226825","volume":"26","author":"G.N. Frederickson","year":"1997","unstructured":"Frederickson, G.N.: Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees. In: Proceeding 32nd Symp. Foundations of Computer Science, pp\u00a0632\u2013641, San Juan, Puerto Rico, October 01\u201304 1991","journal-title":"SIAM J. Comput."},{"key":"156_CR10_156","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1137\/0218008","volume":"18","author":"G.N. Frederickson","year":"1989","unstructured":"Frederickson, G.N., Srinivas, M.A.: Algorithms and data structures for an expanded family of matroid intersection problems. SIAM. J.\u00a0Comput. 18, 112\u2013138 (1989)","journal-title":"SIAM. J. Comput."},{"issue":"2","key":"156_CR11_156","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/S0097539797327209","volume":"31","author":"M.R. Henzinger","year":"2001","unstructured":"Henzinger, M.R., King, V.: Maintaining minimum spanning forests in dynamic graphs. SIAM. J.\u00a0Comput. 31(2), 364\u2013374 (2001)","journal-title":"SIAM. J. Comput."},{"issue":"4","key":"156_CR12_156","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1145\/320211.320215","volume":"46","author":"M.R. Henzinger","year":"1999","unstructured":"Henzinger, M.R., King, V.: Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J.\u00a0ACM 46(4), 502\u2013516 (1999)","journal-title":"J. ACM"},{"key":"156_CR13_156","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/502090.502095","volume":"48","author":"J. Holm","year":"2001","unstructured":"Holm, J., de\u00a0Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J.\u00a0ACM 48, 723\u2013760 (2001)","journal-title":"J. ACM"},{"key":"156_CR14_156","first-page":"85","volume-title":"Symposium \u00fcber Logik und Algorithmik. (1980) See also Mehlhorn, K.: Sorting and Searching","author":"J. Paul","year":"1984","unstructured":"Paul, J., Simon, W.: Decision trees and random access machines. In: Symposium \u00fcber Logik und Algorithmik. (1980) See also Mehlhorn, K.: Sorting and Searching, pp.\u00a085\u201397. Springer, Berlin (1984)"},{"key":"156_CR15_156","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1137\/0214061","volume":"14","author":"R.E. Tarjan","year":"1985","unstructured":"Tarjan, R.E., Vishkin, U.: An efficient parallel biconnectivity algorithm. SIAM. J.\u00a0Comput. 14, 862\u2013874 (1985)","journal-title":"SIAM. J. Comput."}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_156","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T16:32:28Z","timestamp":1738254748000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_156"}},"subtitle":["2000; Holm, de Lichtenberg, Thorup"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_156","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008]]}}}