{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:10:45Z","timestamp":1737436245170,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540427070"},{"type":"electronic","value":"9783540454779"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45477-2_10","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T11:09:01Z","timestamp":1187262541000},"page":"91-102","source":"Crossref","is-referenced-by-count":1,"title":["Planarity of the 2-Level Cactus Model"],"prefix":"10.1007","author":[{"given":"Sabine","family":"Cornelsen","sequence":"first","affiliation":[]},{"given":"Yefim","family":"Dinitz","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,2]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"A. A. Bencz\u00far. A representation of cuts within 6\/5 times the edge connectivity with applications. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS\u2019 95), pages 92\u2013103. IEEE Computer Society Press, 1995.","DOI":"10.1109\/SFCS.1995.492466"},{"key":"10_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-44541-2_10","volume-title":"Proceedings of the 8th International Symposium on Graph Drawing (GD 2000)","author":"U. Brandes","year":"2001","unstructured":"U. Brandes, S. Cornelsen, and D. Wagner. How to draw the minimum cuts of a planar graph. In J. Marks, editor, Proceedings of the 8th International Symposium on Graph Drawing (GD 2000), volume 1984 of Lecture Notes in Computer Science, pages 103\u2013114. Springer, 2001."},{"key":"10_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/3-540-56402-0_44","volume-title":"Graph Theoretic Cocepts in Computer Science, 18th International Workshop, (WG\u2019 92)","author":"Y. Dinitz","year":"1993","unstructured":"Y. Dinitz. The 3-edge-components and a structural description of all 3-edge-cuts in a graph. In E. W. Mayr, editor, Graph Theoretic Cocepts in Computer Science, 18th International Workshop, (WG\u2019 92), volume 657 of Lecture Notes in Computer Science, pages 145\u2013157. Springer, 1993."},{"key":"10_CR4","unstructured":"Y. Dinitz, A. V. Karzanov, and M. Lomonosov. On the structure of a family of minimal weighted cuts in a graph. In A. Fridman, editor, Studies in Discrete Optimization, pages 290\u2013306. Nauka, 1976. (in Russian)."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Y. Dinitz and Z. Nutov. A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance. In Proceedings of the 27th Annual ACM Symposium on the Theory of Computing (STOC\u2019 95), pages 509\u2013518. ACM, The Association for Computing Machinery, 1995.","DOI":"10.1145\/225058.225268"},{"key":"10_CR6","unstructured":"Y. Dinitz and Z. Nutov. A 2-level cactus tree model for the system of minimum and minimum+1 edge cuts of a graph and its incremental maintenance. Technical Report CS0915, Computer Science Department, Technion Haifa, 1997. 50 pages, available at http:\/\/www.cs.technion.ac.il\/users\/wwwb\/cgi-bin\/tr-info.cgif1997\/CS\/CS0%915 ."},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/PL00009195","volume":"20","author":"Y. Dinitz","year":"1998","unstructured":"Y. Dinitz and J. Westbrook. Maintaining the classes of 4-edge-connectivity in a graph on-line. Algorithmica, 20:242\u2013276, 1998.","journal-title":"Algorithmica"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1137\/0222002","volume":"22","author":"Z. Galil","year":"1993","unstructured":"Z. Galil and G. F. Italiano. Maintaining the 3-edge-connected components of a graph on-line. SIAM Journal on Computing, 22(1):11\u201328, 1993.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0020-0190(96)00079-8","volume":"59","author":"M. R. Henzinger","year":"1996","unstructured":"M. R. Henzinger and D. P. Williamson. On the number of small cuts in a graph. Information Processing Letters, 59(1):41\u201344, 1996.","journal-title":"Information Processing Letters"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"C. Kuratowski","year":"1930","unstructured":"C. Kuratowski. Sur le probl\u00e8me des courbes gauches en topologie. Fundamenta Mathematicae, 15:271\u2013283, 1930.","journal-title":"Fundamenta Mathematicae"},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"22","DOI":"10.4064\/fm-28-1-22-32","volume":"28","author":"S. MacLane","year":"1937","unstructured":"S. MacLane. A combinatorial condition for planar graphs. Fundamenta Mathematicae, 28:22\u201332, 1937.","journal-title":"Fundamenta Mathematicae"},{"key":"10_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/3-540-58325-4_181","volume-title":"Proceedings of the 5th International Symposium on Algorithms and Computing (ISAAC\u2019 94)","author":"H. Nagamochi","year":"1994","unstructured":"H. Nagamochi, K. Nishimura, and T. Ibaraki. Computing all small cuts in undirected networks. In D.-Z. Du, editor, Proceedings of the 5th International Symposium on Algorithms and Computing (ISAAC\u2019 94), volume 834 of Lecture Notes in Computer Science, pages 190\u2013198. Springer, 1994."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0095-8956(80)90083-0","volume":"29","author":"C. Thomassen","year":"1980","unstructured":"C. Thomassen. Planarity and duality of finite and infinite graphs. Journal of Combinatorial Theory, Series B, 29:244\u2013271, 1980.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"10_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/3-540-55719-9_88","volume-title":"Proceedings of the 19th International Colloquium on Automata, Languages and Programming","author":"V. V. Vazirani","year":"1992","unstructured":"V. V. Vazirani and M. Yannakakis. Suboptimal cuts: Their enumeration, weight and number. In W. Kuich, editor, Proceedings of the 19th International Colloquium on Automata, Languages and Programming, volume 623 of Lecture Notes in Computer Science, pages 366\u2013377. Springer, 1992."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45477-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T11:36:01Z","timestamp":1737372961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45477-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427070","9783540454779"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45477-2_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}