{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T04:07:28Z","timestamp":1751342848308,"version":"3.41.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[2000,12]]},"DOI":"10.1023\/a:1009885511650","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T23:53:29Z","timestamp":1040601209000},"page":"449-486","source":"Crossref","is-referenced-by-count":3,"title":["Incrementing Bipartite Digraph Edge-Connectivity"],"prefix":"10.1007","volume":"4","author":[{"given":"Harold N.","family":"Gabow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tibor","family":"Jord\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"276202_CR1","volume-title":"Network Flows: Theory, Algorithms and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice Hall: Englewood Cliffs, NJ, 1993."},{"key":"276202_CR2","volume-title":"Incidence and Symmetry in Design and Architecture","author":"J.A. Baglivo","year":"1983","unstructured":"J.A. Baglivo and J.E. Graver, Incidence and Symmetry in Design and Architecture, Cambridge University Press: Cambridge, 1983."},{"issue":"2","key":"276202_CR3","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1137\/S0895480197324700","volume":"12","author":"J. Bang-Jensen","year":"1999","unstructured":"J. Bang-Jensen, H.N. Gabow, T. Jord\u00e1n, and Z. Szigeti, \u201cEdge-connectivity augmentation with partition constraints,\u201d SIAM J. Disc. Math., vol. 12, no. 2, pp. 160\u2013207, 1999.","journal-title":"SIAM J. Disc. Math."},{"key":"276202_CR4","first-page":"91","volume-title":"Combinatorial Algorithms","author":"J. Edmonds","year":"1972","unstructured":"J. Edmonds, \u201cEdge-disjoint branchings,\u201d in Combinatorial Algorithms, R. Rustin (Ed.), Algorithmics Press: New York, 1972, pp. 91\u201396."},{"issue":"1","key":"276202_CR5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1137\/0405003","volume":"5","author":"A. Frank","year":"1992","unstructured":"A. Frank, \u201cAugmenting graphs to meet edge-connectivity requirements,\u201d SIAM J. Disc. Math., vol. 5, no. 1, pp. 25\u201353, 1992.","journal-title":"SIAM J. Disc. Math."},{"key":"276202_CR6","doi-asserted-by":"crossref","unstructured":"H.N. Gabow, \u201cApplications of a poset representation to edge connectivity and graph rigidity,\u201d in Proc. 32nd Annual Symp. on Found. of Comp. Sci., 1991, pp. 812\u2013821.","DOI":"10.1109\/SFCS.1991.185453"},{"issue":"2","key":"276202_CR7","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1006\/jcss.1995.1022","volume":"50","author":"H.N. Gabow","year":"1995","unstructured":"H.N. Gabow, \u201cA matroid approach to finding edge connectivity and packing arborescences,\u201d J. Comp. and System Sci., vol. 50, no. 2, pp. 259\u2013273, 1995.","journal-title":"J. Comp. and System Sci."},{"key":"#cr-split#-276202_CR8.1","unstructured":"H.N. Gabow and T. Jord\u00e1n, \"How to make a square grid framework with cables rigid,\" in Proc. 10th Annual ACMSIAM Symp. on Disc. Algorithms, 1999, pp. 356-365"},{"key":"#cr-split#-276202_CR8.2","doi-asserted-by":"crossref","unstructured":"also SIAM J. Computing, vol. 30, no. 2, pp. 649-680, 2000.","DOI":"10.1137\/S0097539798347189"},{"key":"276202_CR9","unstructured":"H.N. Gabow and T. Jord\u00e1n, \u201cBipartition constrained edge-splitting in directed graphs,\u201d in Proc. 1st Japanese-Hungarian Symp. on Discrete Math. and its Applications, Kyoto, 1999, pp. 225\u2013232; also Discrete Applied Mathematics, to appear."},{"issue":"3","key":"276202_CR10","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1006\/jagm.1994.1043","volume":"17","author":"J. Hao","year":"1994","unstructured":"J. Hao and J.B. Orlin, \u201cA faster algorithm for finding the minimum cut in a directed graph,\u201d J. Algorithms, vol. 17, no. 3, pp. 424\u2013446, 1994.","journal-title":"J. Algorithms"},{"key":"276202_CR11","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1007\/BFb0120902","volume":"13","author":"J.-C. Picard","year":"1980","unstructured":"J.-C. Picard and M. Queyranne, \u201cOn the structure of all minimum cuts in a network and applications,\u201d Math. Prog. Study, vol. 13, pp. 8\u201316, 1980.","journal-title":"Math. Prog. Study"},{"key":"276202_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-22143-3","volume-title":"Matroid Theory and its Applications in Electric Network Theory and in Statics","author":"A. Recski","year":"1989","unstructured":"A. Recski, Matroid Theory and its Applications in Electric Network Theory and in Statics, Akad\u00e9miai Kiad\u00f3, Budapest, 1989."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009885511650.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009885511650\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009885511650.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:13:49Z","timestamp":1751282029000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009885511650"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["276202"],"URL":"https:\/\/doi.org\/10.1023\/a:1009885511650","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}