{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:47:22Z","timestamp":1720640842775},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s1571-0653(05)80158-1","type":"journal-article","created":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T11:08:52Z","timestamp":1114945732000},"page":"185-188","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Connectivity Augmentation of Graphs"],"prefix":"10.1016","volume":"5","author":[{"given":"Bill","family":"Jackson","sequence":"first","affiliation":[]},{"given":"Tibor","family":"Jord\u00e1nn","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(05)80158-1_BIB1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1137\/S0036142993226983","article-title":"Preserving and increasing local edge connectivity in mixed graphs","volume":"12","author":"Bang-Jensen","year":"1995","journal-title":"SIAM J Discrete Math."},{"key":"10.1016\/S1571-0653(05)80158-1_BIB2","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."},{"key":"10.1016\/S1571-0653(05)80158-1_BIB3","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s101070050033","article-title":"Augmenting hypergraphs by edges of size two","volume":"84","author":"Bang-Jensen","year":"1999","journal-title":"Mathematical Programming"},{"key":"10.1016\/S1571-0653(05)80158-1_BIB4","doi-asserted-by":"crossref","unstructured":"J. Bang-Jensen and T. Jord\u00e1n Edge-connectivity augmentation preserving simplicity, SIAM J Discrete Math. 11 151-172.","DOI":"10.1137\/S0895480197318878"},{"key":"10.1016\/S1571-0653(05)80158-1_BIB5","first-page":"151","volume":"19","author":"Cai","year":"1989","journal-title":"The minimum augmentation of any graph to a k-edge-connected graph, Networks"},{"key":"10.1016\/S1571-0653(05)80158-1_BIB6","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1137\/0205044","article-title":"Augmentation problems","volume":"5","author":"Eswaran","year":"1976","journal-title":"SIAM J Computing"},{"key":"10.1016\/S1571-0653(05)80158-1_BIB7","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1137\/0405003","article-title":"Augmenting graphs to meet edge connectivity requirements","volume":"5","author":"Frank","year":"1992","journal-title":"SIAM J. on Discrete Mathematics"},{"key":"10.1016\/S1571-0653(05)80158-1_BIB8","series-title":"Mathematical Programming State of the Art 1994","first-page":"34","article-title":"Connectivity augmentation problems in network design","author":"Frank","year":"1994"},{"key":"10.1016\/S1571-0653(05)80158-1_BIB9","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1006\/jctb.1995.1044","article-title":"Minimal edge-coverings of pairs of sets","volume":"65","author":"Frank","year":"1995","journal-title":"J. Combinatorial Theory Ser. B."},{"key":"10.1016\/S1571-0653(05)80158-1_BIB10","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1006\/jagm.2000.1077","article-title":"On four-connecting a triconnected graph","volume":"35","author":"Hsu","year":"2000","journal-title":"Journal of Algorithms"},{"key":"10.1016\/S1571-0653(05)80158-1_BIB11","first-page":"548","article-title":"A linear time algorithmn for triconnectivity augmentation","author":"Hsu","year":"1991","journal-title":"Proc. 32nd Annual IEEE FOCS Symp."},{"key":"10.1016\/S1571-0653(05)80158-1_BIB12","author":"Jackson","year":"2000","journal-title":"A near optimal algorithm for vertex connectivity augmentation, submitted"},{"key":"10.1016\/S1571-0653(05)80158-1_BIB13","author":"Jackson","year":"2000","journal-title":"Independence free graphs and vertex connectivity augmentation, manuscript"},{"key":"10.1016\/S1571-0653(05)80158-1_BIB14","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1006\/jctb.1995.1002","article-title":"On the optimal vertex-connectivity augmentation","volume":"63","author":"Jord\u00e1n","year":"1995","journal-title":"J. Combinatorial Theory, Ser. B."},{"key":"10.1016\/S1571-0653(05)80158-1_BIB15","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1006\/jctb.1997.1786","article-title":"A note on the vertex-connectivity augmentation problem","volume":"78","author":"Jord\u00e1n","year":"1997","journal-title":"J. Combinatorial Theory, Ser. B."},{"key":"10.1016\/S1571-0653(05)80158-1_BIB16","article-title":"Two NP-complete augmentation problems","author":"Jord\u00e1n","year":"1997","journal-title":"IMADA"},{"key":"10.1016\/S1571-0653(05)80158-1_BIB17","unstructured":"L. Lov\u00e1sz., Combinatorial problems and exercises, North Holland (1997)"},{"key":"10.1016\/S1571-0653(05)80158-1_BIB18","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0167-5060(08)70504-1","article-title":"A reduction method for edge connectivity in graphs","volume":"3","author":"Mader","year":"1978","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S1571-0653(05)80158-1_BIB19","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0195-6698(82)80009-7","article-title":"Konstruktion aller n-fach kantenzusammenh\u00e4ngenden Digraphen","volume":"3","author":"Mader","year":"1982","journal-title":"Europ. J. Combin."},{"key":"10.1016\/S1571-0653(05)80158-1_BIB20","first-page":"698","article-title":"A fast algorithm for optimally increasing the edge-connectivity","author":"Naor","year":"1990","journal-title":"31st Annual IEEE FOCS Symp."},{"key":"10.1016\/S1571-0653(05)80158-1_BIB21","article-title":"Recent development of graph connectivity augmentation algorithms","volume":"3","author":"Nagamochi","year":"2000","journal-title":"IEICE Trans. Inf. And Syst. vol E83-D"},{"key":"10.1016\/S1571-0653(05)80158-1_BIB22","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/s101070050036","article-title":"Hypergraph connectivity augmentation","volume":"84","author":"Szigeti","year":"1999","journal-title":"Mathematical Programming Ser. B"},{"key":"10.1016\/S1571-0653(05)80158-1_BIB23","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0022-0000(87)90038-9","article-title":"Edge-connectivity augmentation problems","volume":"35","author":"Watanabe","year":"1987","journal-title":"Computer and System Sciences"},{"key":"10.1016\/S1571-0653(05)80158-1_BIB24","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0022-0000(93)90050-7","article-title":"A minimum 3-connectivity augmentation of a graph","volume":"46","author":"Watanabe","year":"1993","journal-title":"J. Computer and System Sciences"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801581?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305801581?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T05:17:59Z","timestamp":1586236679000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305801581"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":24,"alternative-id":["S1571065305801581"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80158-1","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}