{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:27:50Z","timestamp":1751282870015},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540583257"},{"type":"electronic","value":"9783540486534"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58325-4_184","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:43:56Z","timestamp":1330271036000},"page":"217-225","source":"Crossref","is-referenced-by-count":3,"title":["Minimum augmentation to k-edge-connect specified vertices of a graph"],"prefix":"10.1007","author":[{"given":"Satoshi","family":"Taoka","sequence":"first","affiliation":[]},{"given":"Toshimasa","family":"Watanabe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"K. P. Eswaran","year":"1976","unstructured":"Eswaran, K. P. and Tarjan, R. E.: Augmentation problems, SIAM J. Comput, 5 (1976), 653\u2013655.","journal-title":"SIAM J. Comput"},{"key":"26_CR2","volume-title":"Graph Algorithms","author":"S. Even","year":"1979","unstructured":"Even, S.: Graph Algorithms, Pitman, London (1979)."},{"issue":"1","key":"26_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1137\/0405003","volume":"5","author":"A. Frank","year":"1992","unstructured":"Frank, A.: Augmenting graphs to meet edge connectivity requirements, SIAM J. Discrete Mathematics, 5, 1 (1992), 25\u201353.","journal-title":"SIAM J. Discrete Mathematics"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Gabow, H. N.: Applications of a Poset Representation to Edge Connectivity and Graph Rigidity, Proc. 32nd IEEE Symposium on Foundations of Computer Science (1991), 812\u2013821.","DOI":"10.1109\/SFCS.1991.185453"},{"key":"26_CR5","unstructured":"Karzanov, A. V. and Timofeev, E. A.: Efficient algorithm for finding all minimal edge cuts of a nonoriented graph, Cybernetics (March\u2013April 1986), 156\u2013162, Translated from Kibernetika, 2 (1986), pp.8\u201312."},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/0405004","volume":"5","author":"H. Nagamochi","year":"1992","unstructured":"Nagamochi, H. and Ibaraki, T.: Computing edge-connectivity in multigraphs and capacitated graphs, SIAM J. Discrete Mathematics, 5 (1992), 54\u201366.","journal-title":"SIAM J. Discrete Mathematics"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/BF01758778","volume":"7","author":"H. Nagamochi","year":"1992","unstructured":"Nagamochi, H. and Ibaraki, T.: A linear time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph, Algorithmica, 7 (1992), 583\u2013596.","journal-title":"Algorithmica"},{"issue":"4","key":"26_CR8","first-page":"513","volume":"E76-A","author":"H. Nagamochi","year":"1993","unstructured":"Nagamochi, H. and Watanabe, T.: Computing k-Edge-Connected Components of a Multigraphs, Trans. IEICE of Japan, E76-A, 4 (1993), 513\u2013517.","journal-title":"Trans. IEICE of Japan"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Naor, D., Gusfield, D. and Martel, C.: A Fast Algorithm for Optimally Increasing the Edge Connectivity, Proc. 31st Annual IEEE Symposium on Foundations of Computer Science (1990), 698\u2013707.","DOI":"10.1109\/FSCS.1990.89592"},{"key":"26_CR10","first-page":"33","volume":"AL-33-5","author":"D. Takafuji","year":"1993","unstructured":"Takafuji, D., Taoka, S. and Watanabe, T.: Simplicity-preserving augmentation to 4-edge-connect a graph, IPSJ SIG Notes, AL-33-5 (May 1993), 33\u201340.","journal-title":"IPSJ SIG Notes"},{"key":"26_CR11","first-page":"49","volume":"COMP93-73","author":"S. Taoka","year":"1994","unstructured":"Taoka, S., Takafuji, D. and Watanabe, T.: Simplicity-preserving augmentation of the edge-connectivity of a graph, Tech. Rep. of IEICE of Japan, COMP93-73 (January 1994), 49\u201356.","journal-title":"Tech. Rep. of IEICE of Japan"},{"key":"26_CR12","first-page":"17","volume":"AL-38-3","author":"S. Taoka","year":"1994","unstructured":"Taoka, S. and Watanabe, T.: Smallest augmentation to k-edge-connect all specified vertices in a graph, IPSJ SIG Notes, AL-38-3 (March 1994), 17\u201324.","journal-title":"IPSJ SIG Notes"},{"key":"26_CR13","volume-title":"Tec. Rep. ACT-76-UILU-ENG-87-2221","author":"T. Watanabe","year":"1987","unstructured":"Watanabe, T.: An efficient way for edge-connectivity augmentation, Tec. Rep. ACT-76-UILU-ENG-87-2221, Coordinated Science Lab., University of Illinois at Urbana, Urbana, IL 61801 (April 1987). Also presented at Eighteenth Southeastern International Conference on Combinatorics, Graph Theory, Computing, No.15, Boca Raton, FL, U.S.A., February 1987."},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Watanabe, T., Higashi, Y. and Nakamura, A.: An approach to robust networks construction from graph augmentation problems, Proc. of 1990 IEEE International Symposium on Circuits and Systems (May 1990), 2861\u20132864.","DOI":"10.1109\/ISCAS.1990.112607"},{"issue":"1","key":"26_CR15","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0022-0000(87)90038-9","volume":"35","author":"T. Watanabe","year":"1987","unstructured":"Watanabe, T. and Nakamura, A.: Edge-connectivity augmentation problems, J. Comput. System Sci., 35, 1 (1987), 96\u2013144.","journal-title":"J. Comput. System Sci."},{"key":"26_CR16","unstructured":"Watanabe, T., Taoka, S. and Mashima, T.: Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph, Proc.1993 IEEE International Symposium on Circuits and Systems (May 1993), 2311\u20132314."},{"issue":"4","key":"26_CR17","first-page":"518","volume":"E76-A","author":"T. Watanbe","year":"1993","unstructured":"Watanbe, T. and Yamakado, M.: A linear time algorithm for smallest augmentation to 3-edge-connect a graph, Trans. IEICE of Japan, E76-A, 4 (1993), 518\u2013531.","journal-title":"Trans. IEICE of Japan"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58325-4_184.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:13:36Z","timestamp":1619572416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58325-4_184"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540583257","9783540486534"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-58325-4_184","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}