{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T00:43:47Z","timestamp":1792111427295,"version":"4.4.0"},"publisher-location":"New York, NY","reference-count":18,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_154","type":"book-chapter","created":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T15:51:54Z","timestamp":1553097114000},"page":"797-800","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fully Dynamic Higher Connectivity"],"prefix":"10.1007","author":[{"given":"Giuseppe F.","family":"Italiano","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"154_CR6328","doi-asserted-by":"crossref","unstructured":"Dinitz EA (1993) Maintaining the 4-edge-connected components of a graph on-line. In: Proceedings of the 2nd Israel symposium on theory of computing and systems, Natanya, pp 88\u201399","DOI":"10.1109\/ISTCS.1993.253480"},{"key":"154_CR6329","first-page":"290","volume-title":"Studies in discrete optimization","author":"EA Dinitz","year":"1990","unstructured":"Dinitz EA, Karzanov AV, Lomonosov MV (1990) On the structure of the system of minimal edge cuts in a graph. In: Fridman AA (ed) Studies in discrete optimization. Nauka, Moscow, pp 290\u2013306 (in Russian)"},{"issue":"5","key":"154_CR6330","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 GF, Nissenzweig A (1997) Sparsification \u2013 a technique for speeding up dynamic graph algorithms. J Assoc Comput Mach 44(5):669\u2013696","journal-title":"J Assoc Comput Mach"},{"issue":"2","key":"154_CR6331","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1137\/S0097539792226825","volume":"26","author":"GN Frederickson","year":"1997","unstructured":"Frederickson GN (1997) Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees. SIAM J Comput 26(2):484\u2013538","journal-title":"SIAM J Comput"},{"key":"154_CR6332","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1137\/0221062","volume":"21","author":"Z Galil","year":"1992","unstructured":"Galil Z, Italiano GF (1992) Fully dynamic algorithms for 2-edge connectivity. SIAM J Comput 21:1047\u20131069","journal-title":"SIAM J Comput"},{"key":"154_CR6333","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1137\/0222002","volume":"22","author":"Z Galil","year":"1993","unstructured":"Galil Z, Italiano GF (1993) Maintaining the 3-edge-connected components of a graph on-line. SIAM J Comput 22:11\u201328","journal-title":"SIAM J Comput"},{"key":"154_CR6334","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph theory","author":"F Harary","year":"1969","unstructured":"Harary F (1969) Graph theory. Addison-Wesley, Reading"},{"issue":"6","key":"154_CR6335","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/BF01189067","volume":"13","author":"MR Henzinger","year":"1995","unstructured":"Henzinger MR (1995) Fully dynamic biconnectivity in graphs. Algorithmica 13(6):503\u2013538","journal-title":"Algorithmica"},{"issue":"6","key":"154_CR6336","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1137\/S0097539794263907","volume":"29","author":"MR Henzinger","year":"2000","unstructured":"Henzinger MR (2000) Improved data structures for fully dynamic biconnectivity. SIAM J Comput 29(6):1761\u20131815","journal-title":"SIAM J Comput"},{"key":"154_CR6337","doi-asserted-by":"crossref","unstructured":"Henzinger M, King V (1995) Fully dynamic biconnectivity and transitive closure. In: Proceedings of the 36th IEEE symposium on foundations of computer science (FOCS'95), Milwaukee, pp 664\u2013672","DOI":"10.1109\/SFCS.1995.492668"},{"issue":"4","key":"154_CR6338","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1145\/320211.320215","volume":"46","author":"MR Henzinger","year":"1999","unstructured":"Henzinger MR, King V (1999) Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J ACM 46(4):502\u2013516","journal-title":"J ACM"},{"key":"154_CR6339","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/502090.502095","volume":"48","author":"J Holm","year":"2001","unstructured":"Holm J, de Lichtenberg K, Thorup M (2001) Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J ACM 48:723\u2013760","journal-title":"J ACM"},{"key":"154_CR6340","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/BF01074775","volume":"22","author":"AV Karzanov","year":"1986","unstructured":"Karzanov AV, Timofeev EA (1986) Efficient algorithm for finding all minimal edge cuts of a nonoriented graph. Cybernetics 22:156\u2013162","journal-title":"Cybernetics"},{"key":"154_CR6341","first-page":"354","volume-title":"Proceedings of the 19th international colloquium on automata, languages and programming. Lecture notes in computer science","author":"JA La Poutr\u00e9","year":"1992","unstructured":"La Poutr\u00e9 JA (1992) Maintenance of triconnected components of graphs. In: La Poutr\u00e9 JA (ed) Proceedings of the 19th international colloquium on automata, languages and programming. Lecture notes in computer science, vol 623. Springer, Berlin, pp 354\u2013365"},{"issue":"5","key":"154_CR6342","doi-asserted-by":"publisher","first-page":"1521","DOI":"10.1137\/S0097539793257770","volume":"29","author":"JA La Poutr\u00e9","year":"2000","unstructured":"La Poutr\u00e9 JA (2000) Maintenance of 2- and 3-edge-connected components of graphs II. SIAM J Comput 29(5):1521\u20131549","journal-title":"SIAM J Comput"},{"key":"154_CR6343","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0012-365X(93)90376-5","volume":"114","author":"JA La Poutr\u00e9","year":"1993","unstructured":"La Poutr\u00e9 JA, van Leeuwen J, Overmars MH (1993) Maintenance of 2- and 3-connected components of graphs, part I: 2- and 3-edge-connected components. Discr Math 114:329\u2013359","journal-title":"Discr Math"},{"key":"154_CR6344","unstructured":"La Poutr\u00e9 JA, Westbrook J (1994) Dynamic two-connectivity with backtracking. In: Proceedings of the 5th ACM-SIAM symposium on discrete algorithms, Arlington, pp 204\u2013212"},{"key":"154_CR6345","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/BF01758773","volume":"7","author":"J Westbrook","year":"1992","unstructured":"Westbrook J, Tarjan RE (1992) Maintaining bridge-connected and biconnected components on-line. Algorithmica 7:433\u2013464","journal-title":"Algorithmica"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_154","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:44:47Z","timestamp":1792107887000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_154"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_154","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}