{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:39Z","timestamp":1759638939302},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578994"},{"type":"electronic","value":"9783540483854"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57899-4_47","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:40:09Z","timestamp":1330245609000},"page":"132-143","source":"Crossref","is-referenced-by-count":10,"title":["Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs"],"prefix":"10.1007","author":[{"given":"Koichi","family":"Wada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kimio","family":"Kawaguchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/0196-6774(88)90015-6","volume":"9","author":"J. Cherian","year":"1988","unstructured":"J. Cherian and S.N. Maheshwari: Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs, Journal of Algorithms,9(1988)507\u2013537","journal-title":"Journal of Algorithms"},{"key":"12_CR2","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0166-218X(85)90008-3","volume":"10","author":"M. E. Dyer","year":"1985","unstructured":"M.E Dyer and A.M. Frieze: On the complexity of partitioning graph into connected subgraphs, Discrete Applied Mathematics, 10(1985)139\u2013153","journal-title":"Discrete Applied Mathematics"},{"key":"12_CR3","volume-title":"Graph algorithms","author":"S. Even","year":"1979","unstructured":"S.Even: Graph algorithms, Computer Science Press, Potomac, MD(1979)"},{"issue":"1","key":"12_CR4","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: Reducing edge connectivity to vertex connectivity, SIGACT NEWS, 22,1(1991)57\u201361","journal-title":"SIGACT NEWS"},{"key":"12_CR5","first-page":"485","volume-title":"Combinatorics(Proc. 5th Hungarian Combinational Colloquy, 1976, Keszthely)","author":"E. Gy\u00f6ri","year":"1978","unstructured":"E. Gy\u00f6ri: On division of connected subgraphs, in: Combinatorics(Proc. 5th Hungarian Combinational Colloquy, 1976, Keszthely) North-Holland, Amsterdam(1978)485\u2013494"},{"issue":"4","key":"12_CR6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(88)90204-9","volume":"28","author":"M. Imase","year":"1988","unstructured":"M. Imase and Y.Manabe: Fault tolerant routings in a \u03ba-connected network, Information Processing Letters, 28,4(1988)171\u2013175","journal-title":"Information Processing Letters"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"K.Kawaguchi and K.Wada: New results in graph routing, Information and Computation (1993)(to appear)","DOI":"10.1006\/inco.1993.1053"},{"issue":"6","key":"12_CR8","first-page":"247","volume":"J76-D-I","author":"K. Kawaguchi","year":"1993","unstructured":"K.Kawaguchi, K.Wada and T.Sugiura: Improvement of the sufficient conditions and the computational complexity in defining optimal graph routings, Trans. of IEICE,J76-D-I, 6(1993)247\u2013259","journal-title":"Trans. of IEICE"},{"key":"12_CR9","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01896190","volume":"30","author":"L. Lov\u00e1sz","year":"1977","unstructured":"L. Lov\u00e1sz: A homology theory for spanning trees of a graph, Acta mathematica Academic Science of Hungary,30(1977)241\u2013251","journal-title":"Acta mathematica Academic Science of Hungary"},{"issue":"5\/6","key":"12_CR10","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/BF01758778","volume":"7","author":"H. Nagamochi","year":"1992","unstructured":"H. Nagamochi and T. Ibaraki: A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph, Algorithmica, 7,5\/6(1992)583\u2013596","journal-title":"Algorithmica"},{"issue":"5","key":"12_CR11","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0020-0190(90)90189-5","volume":"33","author":"H. Suzuki","year":"1990","unstructured":"H.Suzuki, N.Takahashi and T.Nishizeki: A linear algorithm for bipartition of biconnected graphs, Information Processing Letters, 33,5(1990)227\u2013232","journal-title":"Information Processing Letters"},{"issue":"5","key":"12_CR12","first-page":"584","volume":"31","author":"H. Suzuki","year":"1990","unstructured":"H.Suzuki, N.Takahashi, T.Nishizeki, H. Miyano and S.Ueno: An algorithm for tripartitioning 3-connected graphs, Information Processing Society of Japan, 31,5(1990)584\u2013592","journal-title":"Information Processing Society of Japan"},{"issue":"11","key":"12_CR13","first-page":"993","volume":"J75-D-I","author":"K. Wada","year":"1992","unstructured":"K.Wada, T.Shibuya, E.Shamoto and K.Kawaguchi: A linear time (L, k)-edgepartition algorithm for connected graphs and fault-tolerant routings for k-edgeconnected graphs, Trans. of IEICE, J75-D-I,11(1992)993\u20131004","journal-title":"Trans. of IEICE"},{"key":"12_CR14","unstructured":"K.Wada, K.Kawaguchi and N.Yokoyama: On a generalized k-partition problem for graphs, Proc. the 6th Karuizawa Workshop on Circuit and Systems(1993)243\u2013248"},{"key":"12_CR15","unstructured":"K.Wada, A.Takagi and K.Kawaguchi: Efficient algorithms for k-edge-partition problem without specified edges, Kawaguchi Lab. Technical Report of ECE in Nagoya Institute of Technology,TR-01-93(1993)"}],"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-57899-4_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:09:35Z","timestamp":1619557775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57899-4_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578994","9783540483854"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-57899-4_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}