{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:43:56Z","timestamp":1759063436414},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3772,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s1571-0661(04)81016-8","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"236-259","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs"],"prefix":"10.1016","volume":"78","author":[{"given":"Toshimasa","family":"Ishii","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoko","family":"Akiyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Nagamochi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)81016-8_NEWBIB1","first-page":"54","volume":"42","author":"Arata","year":"2002","journal-title":"Locating sources to meet flow demands in undirected networks, J. Algorithms"},{"key":"10.1016\/S1571-0661(04)81016-8_NEWBIB2","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1137\/S0895480197324700","article-title":"Edge-connectivity augmentation with partition constraints","volume":"12","author":"Bang-Jensen","year":"1999","journal-title":"SIAM J. Discrete Math"},{"issue":"1","key":"10.1016\/S1571-0661(04)81016-8_NEWBIB3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1137\/0405003","article-title":"Augmenting graphs to meet edge-connectivity requirements","volume":"5","author":"Frank","year":"1992","journal-title":"SIAM J. Discrete Math"},{"key":"10.1016\/S1571-0661(04)81016-8_NEWBIB4","series-title":"Connectivity augmentation problems in network design, in Mathematical Programming: State of the Art 1994","first-page":"34","author":"Frank","year":"1994"},{"key":"10.1016\/S1571-0661(04)81016-8_NEWBIB5","doi-asserted-by":"crossref","unstructured":"Gabow, H. N., Applications of a poset representation to edge connectivity and graph rigidity, Proc. 32nd IEEE Symp. Found. Comp. Sci., (1991), 812\u2013821.","DOI":"10.1109\/SFCS.1991.185453"},{"key":"10.1016\/S1571-0661(04)81016-8_NEWBIB6","series-title":"Handbook in Operations Research and Management Science, 7, Network Models","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/S0927-0507(05)80127-6","article-title":"Design of survivable networks","author":"Gr\u00f6tshel","year":"1995"},{"issue":"4","key":"10.1016\/S1571-0661(04)81016-8_NEWBIB7","first-page":"463","article-title":"Node-to-area connectivity of graphs","volume":"11C","author":"Ito","year":"1994","journal-title":"Transactions of the Institute of Electrical Engineers of Japan"},{"key":"10.1016\/S1571-0661(04)81016-8_NEWBIB8","unstructured":"Ito H., Node-to-area connectivity of graphs, In M. Fushimi and K. Tone, editors, Proceedings of APORS94, World Scientific publishing, (1995), 89\u201396."},{"key":"10.1016\/S1571-0661(04)81016-8_NEWBIB9","unstructured":"Ito, H., K. Makino, K. Arata, K. Itatsu, and s. Fujishige, Source location problem with edge-connectivity requirements in digraphs, Proceeding of 2nd Japanese-Hungarian Sumposium on Discrete Mathematics and Its Applications, (2001), 92\u201397."},{"issue":"3","key":"10.1016\/S1571-0661(04)81016-8_NEWBIB10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/(SICI)1097-0037(199805)31:3<157::AID-NET2>3.0.CO;2-E","article-title":"Edge connectivity between nodes and node-subsets","volume":"31","author":"Ito","year":"1998","journal-title":"Networks"},{"key":"10.1016\/S1571-0661(04)81016-8_NEWBIB11","unstructured":"Kant G., Algorithms for drawing planar graphs, PhD thesis, Dept. of Computer Science, Utrecht University, the Netherlands, (1993)."},{"key":"10.1016\/S1571-0661(04)81016-8_NEWBIB12","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/S0895480193243274","article-title":"Data security equals graph connectivity","volume":"9","author":"Kao","year":"1996","journal-title":"SIAM J. Discrete Math"},{"key":"10.1016\/S1571-0661(04)81016-8_NEWBIB13","unstructured":"Miwa H., and H. Ito, Edge augmenting problems for increasing conncetivity between vertices and vertex subsets, 1999 Technical Report of IPSJ, 99-AL-66(8), (1999), 17\u201324."},{"key":"10.1016\/S1571-0661(04)81016-8_NEWBIB14","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1009739202898","article-title":"Deterministic \u00d5(nm) time edge-splitting in undirected graphs","volume":"1","author":"Nagamochi","year":"1997","journal-title":"J. Combinatorial Optimization"},{"issue":"6","key":"10.1016\/S1571-0661(04)81016-8_NEWBIB15","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0020-0190(01)00183-1","article-title":"Minimum cost source location problem with vertex-connectivity requirements in digraphs","volume":"80","author":"Nagamochi","year":"2001","journal-title":"Information Processing Letters"},{"key":"10.1016\/S1571-0661(04)81016-8_NEWBIB16","doi-asserted-by":"crossref","unstructured":"Tsukiyama S., K. Koike and I. Shirakawa, An algorithm to eliminate all complex triangles in a maximal planar graph for use in VLSI floor-plan, proc. ISCAS'86, (1986), 321\u2013324.","DOI":"10.1142\/9789812794468_0011"},{"key":"10.1016\/S1571-0661(04)81016-8_NEWBIB17","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0022-0000(87)90038-9","article-title":"Edge-connectivity augmentation problems","volume":"35","author":"Watanable","year":"1987","journal-title":"J. Comput. System Sci"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104810168?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104810168?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T03:12:49Z","timestamp":1585883569000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104810168"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":17,"alternative-id":["S1571066104810168"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)81016-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}