{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:01:20Z","timestamp":1725544880423},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422259"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-45535-3_21","type":"book-chapter","created":{"date-parts":[[2010,2,11]],"date-time":"2010-02-11T14:39:51Z","timestamp":1265899191000},"page":"264-279","source":"Crossref","is-referenced-by-count":2,"title":["Independence Free Graphs and Vertex connectivity Augmentation"],"prefix":"10.1007","author":[{"given":"Bill","family":"Jackson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tibor","family":"Jordn\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","first-page":"151","volume":"19","author":"G.R. Cai","year":"1989","unstructured":"G.R. Cai and Y.G. Sun, The minimum augmentation of any graph to a k-edge connected graph, Networks 19 (1989) 151\u2013172.","journal-title":"The minimum augmentation of any graph to a k-edge connected graph, Networks"},{"issue":"4","key":"21_CR2","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"K.P. Eswaran","year":"1976","unstructured":"K.P. Eswaran and R.E. Tarjan, Augmentation problems, SIAM J. Computing, Vol. 5,No. 4, 653\u2013665, 1976.","journal-title":"SIAM J. Computing"},{"issue":"1","key":"21_CR3","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1137\/0405003","volume":"5","author":"A. Frank","year":"1992","unstructured":"A. Frank, Augmenting graphs to meet edge-connectivity requirements, SIAM J. Discrete Mathematics, Vol.5,No 1, 22\u201353, 1992.","journal-title":"SIAM J. Discrete Mathematics"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jctb.1995.1044","volume":"65","author":"A. Frank","year":"1995","unstructured":"A. Frank and T. Jord\u00e1n, Minimal edge-coverings of pairs of sets, J. Combinatorial Theory, Ser. B. 65, 73\u2013110 (1995).","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s101070050039","volume":"84","author":"E. Gy\u0151ri","year":"1999","unstructured":"E. Gy\u0151ri, T. Jord\u00e1n, How to make a graph four-connected, Mathematical Programming 84 (1999) 3, 555\u2013563.","journal-title":"Mathematical Programming"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1006\/jagm.2000.1077","volume":"35","author":"T.S. Hsu","year":"2000","unstructured":"T.S. Hsu, On four-connecting a triconnected graph, Journal of Algorithms 35, 202\u2013234, 2000.","journal-title":"Journal of Algorithms"},{"key":"21_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/3-540-40996-3_27","volume-title":"Proc. ISAAC 2000","author":"B. Jackson","year":"2000","unstructured":"B. Jackson, T. Jord\u00e1n, A near optimal algorithm for vertex-connectivity augmentation, Proc. ISAAC 2000, (D.T. Lee and S.-H. Teng, eds) Springer Lecture Notes in Computer Science 1969, pp. 313\u2013325, 2000."},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1006\/jctb.1995.1002","volume":"63","author":"T. Jord\u00e1n","year":"1995","unstructured":"T. Jord\u00e1n, On the optimal vertex-connectivity augmentation, J. Combinatorial Theory, Ser. B. 63, 8\u201320,1995.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1006\/jctb.1997.1786","volume":"71","author":"T. Jord\u00e1n","year":"1997","unstructured":"T. Jord\u00e1n, A note on the vertex-connectivity augmentation problem, J. Combinatorial Theory, Ser. B. 71, 294\u2013301, 1997.","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1002\/(SICI)1097-0118(199907)31:3<179::AID-JGT3>3.0.CO;2-7","volume":"31","author":"T. Jord\u00e1n","year":"1999","unstructured":"T. Jord\u00e1n, Extremal graphs in connectivity augmentation, J. Graph Theory 31: 179\u2013193, 1999.","journal-title":"J. Graph Theory"},{"key":"21_CR11","unstructured":"H. Nagamochi, Recent development of graph connectivity augmentation algorithms, IEICE Trans. Inf. and Syst., vol E83-D,no.3, March 2000."},{"issue":"1","key":"21_CR12","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/0022-0000(87)90038-9","volume":"35","author":"T. Watanabe","year":"1987","unstructured":"T. Watanabe and A. Nakamura, Edge-connectivity augmentation problems, Computer and System Siences, Vol 35,No. 1, 96\u2013144, 1987.","journal-title":"Computer and System Siences"},{"issue":"1","key":"21_CR13","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0022-0000(93)90050-7","volume":"46","author":"T. Watanabe","year":"1993","unstructured":"T. Watanabe and A. Nakamura, A minimum 3-connectivity augmentation of a graph, J. Computer and System Sciences, Vol. 46,No.1, 91\u2013128, 1993.","journal-title":"J. Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T20:06:10Z","timestamp":1548360370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45535-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540422259"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45535-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}