{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:26:01Z","timestamp":1759335961129,"version":"3.41.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1023\/a:1024470929537","type":"journal-article","created":{"date-parts":[[2003,9,15]],"date-time":"2003-09-15T17:22:37Z","timestamp":1063646557000},"page":"137-159","source":"Crossref","is-referenced-by-count":4,"title":["An Edge-Splitting Algorithm in Planar Graphs"],"prefix":"10.1007","volume":"7","author":[{"given":"Hiroshi","family":"Nagamochi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Eades","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5128225_CR1","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1137\/S0895480197324700","volume":"12","author":"J. Bang-Jensen","year":"1999","unstructured":"J. Bang-Jensen, H.N. Gabow, T. Jord\u00e1n, and Z. Szigeti, \u201cEdge-connectivity augmentation with partition constraints,\u201d SIAM J. Disc. Math., vol. 12, pp. 160\u2013207, 1999.","journal-title":"SIAM J. Disc. Math."},{"key":"5128225_CR2","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1137\/S0895480197318878","volume":"11","author":"J. Bang-Jensen","year":"1998","unstructured":"J. Bang-Jensen and T. Jord\u00e1n, \u201cEdge-connectivity augmentation preserving simplicity,\u201d SIAM J. Disc. Math., vol. 11, pp. 603\u2013623, 1998.","journal-title":"SIAM J. Disc. Math."},{"key":"5128225_CR3","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/net.3230190112","volume":"19","author":"G.-R. Cai","year":"1989","unstructured":"G.-R. Cai and Y.-G. Sun, \u201cThe minimum augmentation of any graph to k-edge-connected graph,\u201d Networks, vol. 19, pp. 151\u2013172, 1989.","journal-title":"Networks"},{"key":"5128225_CR4","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"K.P. Eswaran","year":"1976","unstructured":"K.P. Eswaran and R.E. Tarjan, \u201cAugmentation problems,\u201d SIAM J. Computing, vol. 5, pp. 653\u2013665, 1976.","journal-title":"SIAM J. Computing"},{"key":"5128225_CR5","unstructured":"S. Fialko and P. Mutzel, \u201cA new approximation algorithm for the planar augmentation problem,\u201d in Proc. of 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 260\u2013269."},{"key":"5128225_CR6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1137\/0405003","volume":"5","author":"A. Frank","year":"1992","unstructured":"A. Frank, \u201cAugmenting graphs to meet edge-connectivity requirements,\u201d SIAM J. Discrete Mathematics, vol. 5, pp. 25\u201353, 1992.","journal-title":"SIAM J. Discrete Mathematics"},{"key":"5128225_CR7","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1002\/jgt.3190170302","volume":"17","author":"A. Frank","year":"1993","unstructured":"A. Frank, T. Ibaraki, and H. Nagamochi, \u201cOn sparse subgraphs preserving connectivity properties,\u201d J. Graph Theory, vol. 17, pp. 275\u2013281, 1993.","journal-title":"J. Graph Theory"},{"key":"5128225_CR8","doi-asserted-by":"crossref","unstructured":"H.N. Gabow, \u201cEfficient splitting off algorithms for graphs,\u201d in Proc. 26thACMSymposium on Theory of Computing, 1994, pp. 696\u2013705.","DOI":"10.1145\/195058.195436"},{"key":"5128225_CR9","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/122413.122416","volume":"22","author":"Z. Galil","year":"1991","unstructured":"Z. Galil and G.F. Italiano, \u201cReducing edge connectivity to vertex connectivity,\u201d SIGACT News, vol. 22, pp. 57\u201361, 1991.","journal-title":"SIGACT News"},{"key":"5128225_CR10","unstructured":"T. Jord\u00e1n, \u201cTwo NP-complete augmentation problems,\u201d Odense University Preprints no. 8, 1997."},{"key":"5128225_CR11","doi-asserted-by":"crossref","unstructured":"T. Jord\u00e1n, \u201cEdge-splitting problems with demands,\u201d Lecture Notes in Computer Science, 1610, Springer-Verlag, 7th Conference on Integer Programming and Combinatorial Optimization, 1999, pp. 273\u2013288.","DOI":"10.1007\/3-540-48777-8_21"},{"key":"5128225_CR12","unstructured":"G. Kant, \u201cAlgorithms for drawing planar graphs,\u201d Ph.D. Thesis, Dept. of Computer Science, Utrecht University, 1993."},{"key":"5128225_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.1996.0034","volume":"21","author":"G. Kant","year":"1996","unstructured":"G. Kant, \u201cAugmenting outerplanar graphs,\u201d J. Algorithms, vol. 21, pp. 1\u201325, 1996.","journal-title":"J. Algorithms"},{"key":"5128225_CR14","unstructured":"G. Kant and H.L. Bodlaender, \u201cPlanar graph augmentation problems,\u201d Lecture Notes in Compter Science, 621, Springer-Verlag, 3rd Scand. Workshop on Algorithm Theory, pp. 258\u2013271, 1992."},{"key":"5128225_CR15","unstructured":"L. Lov\u00e1sz, Combinatorial Problems and Exercises, North-Holland, 1979."},{"key":"5128225_CR16","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF03167564","volume":"9","author":"H. Nagamochi","year":"1992","unstructured":"H. Nagamochi and T. Ibaraki, \u201cA linear time algorithm for computing 3-edge-connected components in multigraphs,\u201d J. of Japan Society for Industrial and Applied Mathematics, vol. 9, pp. 163\u2013180, 1992.","journal-title":"J. of Japan Society for Industrial and Applied Mathematics"},{"key":"5128225_CR17","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1009739202898","volume":"1","author":"H. Nagamochi","year":"1997","unstructured":"H. Nagamochi and T. Ibaraki, \u201cDeterministic \u00d5 (nm) time edge-splitting in undirected graphs,\u201d J. Combinatorial Optimization, vol. 1, pp. 5\u201346, 1997.","journal-title":"J. Combinatorial Optimization"},{"key":"5128225_CR18","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0020-0190(98)00114-8","volume":"67","author":"H. Nagamochi","year":"1998","unstructured":"H. Nagamochi and T. Ibaraki, \u201cA note on minimizing submodular functions,\u201d Information Processing Letters, vol. 67, pp. 239\u2013244, 1998.","journal-title":"Information Processing Letters"},{"key":"5128225_CR19","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/s004539910004","volume":"26","author":"H. Nagamochi","year":"2000","unstructured":"H. Nagamochi, S. Nakamura, and T. Ibaraki, \u201cA simplified \u00d5 (nm) time edge-splitting algorithm in undirected graphs,\u201d Algorithmica, vol. 26, pp. 56\u201367, 2000.","journal-title":"Algorithmica"},{"key":"5128225_CR20","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1137\/S0895480194271323","volume":"10","author":"H. Nagamochi","year":"1997","unstructured":"H. Nagamochi, K. Nishimura, and T. Ibaraki, \u201cComputing all small cuts in undirected networks,\u201d SIAM J. Discrete Mathematics, vol. 10, pp. 469\u2013481, 1997.","journal-title":"SIAM J. Discrete Mathematics"},{"key":"5128225_CR21","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"R.E. Tarjan, \u201cDepth-first search and linear graph algorithms,\u201d SIAM J. Computing, vol. 1, pp. 146\u2013160, 1972.","journal-title":"SIAM J. Computing"},{"key":"5128225_CR22","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0022-0000(87)90038-9","volume":"35","author":"T. Watanabe","year":"1987","unstructured":"T. Watanabe and A. Nakamura, \u201cEdge-connectivity augmentation problems,\u201d J. Comp. System Sci., vol. 35, pp. 96\u2013144, 1987.","journal-title":"J. Comp. System Sci."},{"key":"5128225_CR23","first-page":"410","volume":"E75-A","author":"T. Watanabe","year":"1992","unstructured":"T. Watanabe, S. Taoka, and K. Onaga, \u201cA linear-time algorithm for computing all 3-edge-components of a multigraph,\u201d Trans. Inst. Electron. Inform. Comm. Eng. Jap., vol. E75-A, pp. 410\u2013424, 1992.","journal-title":"Trans. Inst. Electron. Inform. Comm. Eng. Jap."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024470929537.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1024470929537\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024470929537.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:15:36Z","timestamp":1751282136000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1024470929537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["5128225"],"URL":"https:\/\/doi.org\/10.1023\/a:1024470929537","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}