{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:10Z","timestamp":1725664570477},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540594086"},{"type":"electronic","value":"9783540492450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59408-6_69","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:16:17Z","timestamp":1330276577000},"page":"414-425","source":"Crossref","is-referenced-by-count":0,"title":["How to make a strongly connected digraph two-connected"],"prefix":"10.1007","author":[{"given":"A.","family":"Frank","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Jord\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"No.4","key":"33_CR1","doi-asserted-by":"crossref","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":"No1","key":"33_CR2","doi-asserted-by":"crossref","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. on Discrete Mathematics, Vol. 5, No 1., 22\u201353, 1992","journal-title":"SIAM J. on Discrete Mathematics"},{"key":"33_CR3","unstructured":"A. Frank, Connectivity augmentation, Proceedings of the Mathematical Programming Symposium, held in Ann Arbor (USA), 1994"},{"key":"33_CR4","unstructured":"A. Frank and T. Jord\u00e1n, Minimal edge-coverings of pairs of sets, J. Combinatorial Theory, Ser. B, to appear"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"T.-s. Hsu and V. Ramachandran, A linear time algorithm for triconnectivity augmentation, in: Proc. 32nd Annual IEEE Symp. on Foundations of Comp.Sci, 548\u2013559, 1991","DOI":"10.1109\/SFCS.1991.185418"},{"key":"33_CR6","doi-asserted-by":"crossref","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":"33_CR7","unstructured":"T. Jord\u00e1n, Optimal and almost optimal algorithms for connectivity augmentation problems, in: Proc. of the third IPCO conference (G. Rinaldi and L. Wolsey, eds.), 75\u201388, 1993"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"T. Jord\u00e1n, Increasing the vertex-connectivity in directed graphs, in: Proceedings of the First Annual European Symposium on Algorithms, Bad Honnef, Springer Lecture Notes in Computer Science, 726, 236\u2013247, 1993","DOI":"10.1007\/3-540-57273-2_59"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"D. Naor, D. Gusfield and Ch. Martel, A fast algorithm for optimally increasing the edge-connectivity, 31st Annual Symposium on Foundations of Computer Science, 698\u2013707, 1990","DOI":"10.1109\/FSCS.1990.89592"},{"issue":"No.1","key":"33_CR10","doi-asserted-by":"crossref","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":"No.1","key":"33_CR11","doi-asserted-by":"crossref","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":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59408-6_69.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:27:06Z","timestamp":1605648426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59408-6_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540594086","9783540492450"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-59408-6_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}