{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:40:12Z","timestamp":1742596812609,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540572732"},{"type":"electronic","value":"9783540480327"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57273-2_59","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:36:52Z","timestamp":1330259812000},"page":"236-247","source":"Crossref","is-referenced-by-count":2,"title":["Increasing the vertex-connectivity in directed graphs"],"prefix":"10.1007","author":[{"given":"Tibor","family":"Jord\u00e1n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1137\/0403027","volume":"3","author":"D. Bienstock","year":"1990","unstructured":"D. Bienstock, E.F. Brickell, C.L. Monma, On the Structure of Minimum-weight k-connected Spanning Networks, SIAM J. Disc. Math., Vol. 3., pp.320\u2013329, 1990","journal-title":"SIAM J. Disc. Math."},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"K.P. Eswaran","year":"1976","unstructured":"K.P. Eswaran, R.E. Tarjan, Augmentation Problems, SIAM J. Comput., 5, 1976, pp.653\u2013665","journal-title":"SIAM J. Comput."},{"issue":"No.I","key":"21_CR3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1137\/0405003","volume":"5","author":"A. Frank","year":"1992","unstructured":"A. Frank, Augmenting Graphs to Meet Edge-connectivity Requirements, SIAM J. Disc. Math., Vol.5, No.I., pp.25\u201353, 1992","journal-title":"SIAM J. Disc. Math."},{"unstructured":"A.Frank, T.Jord\u00e1n, Minimal Edge-Coverings of Pairs of Sets, submitted","key":"21_CR4"},{"doi-asserted-by":"crossref","unstructured":"T.S.Hsu, On Four-Connecting a Triconnected Graph, In Proc. 33th Annual IEEE Symp. on FOCS, 1992","key":"21_CR5","DOI":"10.1109\/SFCS.1992.267817"},{"doi-asserted-by":"crossref","unstructured":"T.S.Hsu, V.Ramachandran, A Linear Time Algorithm for Triconnectivity Augmentation, In Proc. 32th Annual IEEE Symp. on FOCS, 1991, pp.548\u2013559","key":"21_CR6","DOI":"10.1109\/SFCS.1991.185418"},{"unstructured":"T.Jord\u00e1n, Optimal and Almost Optimal Algorithms for Connectivity Augmentation Problems, Proc. Third IPCO Conference (G.Rinaldi and L.Wolsey eds.), 1993, pp.75\u201388","key":"21_CR7"},{"key":"21_CR8","volume-title":"Combinatorial Problems and Exercises","author":"L. Lov\u00e1sz","year":"1979","unstructured":"L. Lov\u00e1sz, Combinatorial Problems and Exercises, North-Holland, Amsterdam, 1979"},{"key":"21_CR9","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0195-6698(82)80009-7","volume":"3","author":"W. Mader","year":"1982","unstructured":"W. Mader, Konstruktion aller n-fach kantenzusammenhangenden Digraphen, European J. Combin., 3, 1982, pp.63\u201367","journal-title":"European J. Combin."},{"key":"21_CR10","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/0095-8956(85)90076-0","volume":"38","author":"W. Mader","year":"1985","unstructured":"W. Mader, Minimal n-fach Zusammenh\u00e4ngende Digraphen, Journal of Combinatorial Theory (B),38, 1985, pp.102\u2013117","journal-title":"Journal of Combinatorial Theory (B)"},{"doi-asserted-by":"crossref","unstructured":"T.Masuzawa, K.Hagihara, N.Tokura, An Optimal Time Algorithm for the k-vertex-connectivity Unweighted Augmentation Problem for Rooted Directed Trees, Disc. Applied Math., 1987, pp.67\u2013105","key":"21_CR11","DOI":"10.1016\/0166-218X(87)90007-2"},{"doi-asserted-by":"crossref","unstructured":"T.Watanabe, A.Nakamura, 3-connectivity Augmentation Problems, In Proc. of IEEE Symp. on Circuits and Systems, 1988, pp.1847\u20131850","key":"21_CR12","DOI":"10.1109\/ISCAS.1988.15296"}],"container-title":["Lecture Notes in Computer Science","Algorithms\u2014ESA '93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57273-2_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:05:20Z","timestamp":1742594720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57273-2_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572732","9783540480327"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-57273-2_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}