{"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":1794357173539,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":18,"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_154","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T14:35:59Z","timestamp":1214490959000},"page":"335-337","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","reference":[{"key":"154_CR1_154","unstructured":"Dinitz, E.A.: Maintaining the 4-edge\u2010connected components of a\u00a0graph on-line. In: Proc. 2nd Israel Symp. Theory of Computing and Systems, 1993, pp.\u00a088\u201399"},{"key":"154_CR2_154","first-page":"290","volume-title":"Studies in Discrete Optimization","author":"E.A. Dinitz","year":"1990","unstructured":"Dinitz, E.A., Karzanov A.V., Lomonosov M.V.: On the structure of the system of minimal edge cuts in a\u00a0graph. In: Fridman, A.A. (ed) Studies in Discrete Optimization, pp.\u00a0290\u2013306. Nauka, Moscow (1990). In Russian"},{"issue":"5","key":"154_CR3_154","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 \u2013 a\u00a0technique for speeding up dynamic graph algorithms. J.\u00a0Assoc. Comput. Mach. 44(5), 669\u2013696 (1997)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"2","key":"154_CR4_154","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\u2010connectivity and k smallest spanning trees. SIAM J.\u00a0Comput. 26(2), 484\u2013538 (1997)","journal-title":"SIAM J. Comput."},{"key":"154_CR5_154","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1137\/0221062","volume":"21","author":"Z. Galil","year":"1992","unstructured":"Galil, Z., Italiano, G.\u00a0F.: Fully dynamic algorithms for 2-edge\u2010connectivity. SIAM J.\u00a0Comput. 21, 1047\u20131069 (1992)","journal-title":"SIAM J. Comput."},{"key":"154_CR6_154","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1137\/0222002","volume":"22","author":"Z. Galil","year":"1993","unstructured":"Galil, Z., Italiano, G.F.: Maintaining the 3-edge\u2010connected components of a\u00a0graph on-line. SIAM J.\u00a0Comput. 22, 11\u201328 (1993)","journal-title":"SIAM J. Comput."},{"key":"154_CR7_154","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F.: Graph Theory. Addison\u2010Wesley, Reading (1969)"},{"issue":"6","key":"154_CR8_154","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/BF01189067","volume":"13","author":"M.R. Henzinger","year":"1995","unstructured":"Henzinger, M.R.: Fully dynamic biconnectivity in graphs. Algorithmica 13(6), 503\u2013538 (1995)","journal-title":"Algorithmica"},{"issue":"6","key":"154_CR9_154","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1137\/S0097539794263907","volume":"29","author":"M.R. Henzinger","year":"2000","unstructured":"Henzinger, M.R.: Improved data structures for fully dynamic biconnectivity. SIAM J.\u00a0Comput. 29(6), 1761\u20131815 (2000)","journal-title":"SIAM J. Comput."},{"key":"154_CR10_154","unstructured":"Henzinger, M., King V.: Fully dynamic biconnectivity and transitive closure. In: Proc. 36th IEEE Symposium on Foundations of Computer Science (FOCS'95), 1995, pp.\u00a0664\u2013672"},{"issue":"4","key":"154_CR11_154","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":"154_CR12_154","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.: Poly\u2010logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J.\u00a0ACM 48, 723\u2013760 (2001)","journal-title":"J. ACM"},{"key":"154_CR13_154","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/BF01074775","volume":"22","author":"A.V. Karzanov","year":"1986","unstructured":"Karzanov, A.V., Timofeev, E.\u00a0A.: Efficient algorithm for finding all minimal edge cuts of a\u00a0nonoriented graph. Cybernetics 22, 156\u2013162 (1986)","journal-title":"Cybernetics"},{"key":"154_CR14_154","first-page":"354","volume-title":"Proc. 19th Int. Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 623","author":"J.A. La Poutr\u00e9","year":"1992","unstructured":"La Poutr\u00e9, J.A.: Maintenance of triconnected components of graphs. In: Proc. 19th Int. Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol.\u00a0623, pp.\u00a0354\u2013365. Springer, Berlin (1992)"},{"issue":"5","key":"154_CR15_154","doi-asserted-by":"publisher","first-page":"1521","DOI":"10.1137\/S0097539793257770","volume":"29","author":"J.A. La Poutr\u00e9","year":"2000","unstructured":"La Poutr\u00e9, J.A.: Maintenance of 2- and 3-edge\u2010connected components of graphs II. SIAM J.\u00a0Comput. 29(5), 1521\u20131549 (2000)","journal-title":"SIAM J. Comput."},{"key":"154_CR16_154","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0012-365X(93)90376-5","volume":"114","author":"J.A. La Poutr\u00e9","year":"1993","unstructured":"La Poutr\u00e9, J.A., van Leeuwen, J., Overmars, M.H.: Maintenance of 2- and 3\u2011connected components of graphs, part I: 2- and 3-edge\u2010connected components. Discret. Math. 114, 329\u2013359 (1993)","journal-title":"Discret. Math."},{"key":"154_CR17_154","unstructured":"La Poutr\u00e9, J.A., Westbrook, J.: Dynamic two\u2010connectivity with backtracking. In: Proc. 5th ACM-SIAM Symp. Discrete Algorithms, 1994, pp.\u00a0204\u2013212"},{"key":"154_CR18_154","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/BF01758773","volume":"7","author":"J. Westbrook","year":"1992","unstructured":"Westbrook, J., Tarjan, R.E.: Maintaining bridge\u2010connected and biconnected components on-line. Algorithmica 7, 433\u2013464 (1992)","journal-title":"Algorithmica"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_154","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,2]],"date-time":"2022-09-02T22:15:15Z","timestamp":1662156915000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_154"}},"subtitle":["1997; Eppstein, Galil, Italiano, Nissenzweig"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_154","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]]}}}