{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:57:17Z","timestamp":1725479837134},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642366932"},{"type":"electronic","value":"9783642366949"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36694-9_17","type":"book-chapter","created":{"date-parts":[[2013,3,11]],"date-time":"2013-03-11T06:08:39Z","timestamp":1362982119000},"page":"193-204","source":"Crossref","is-referenced-by-count":1,"title":["Single Commodity-Flow Algorithms for Lifts of Graphic and Co-graphic Matroids"],"prefix":"10.1007","author":[{"given":"Bertrand","family":"Guenin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leanne","family":"Stuive","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/0021-8693(69)90085-4","volume":"13","author":"W.G. Bridges","year":"1969","unstructured":"Bridges, W.G., Ryser, H.J.: Combinatorial Designs and Related Systems. Journal of Algebra\u00a013, 432\u2013446 (1969)","journal-title":"Journal of Algebra"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Cornu\u00e9jols, G.: Combinatorial Optimization: Packing and covering. CBMS-NSF Regional Conference Series in Applied Mathematics, vol.\u00a072 (2001)","DOI":"10.1137\/1.9780898717105"},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/S0022-247X(62)80004-3","volume":"5","author":"R.J. Duffin","year":"1962","unstructured":"Duffin, R.J.: The extremal length of a network. Journal of Mathematical Analysis and Applications\u00a05(2), 200\u2013215 (1962)","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian J. of Math.\u00a08, 399\u2013404 (1956)","journal-title":"Canadian J. of Math."},{"key":"17_CR5","unstructured":"Geelen, J.J.: Personal Communication"},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jctb.2002.2128","volume":"86","author":"J.F. Geelen","year":"2002","unstructured":"Geelen, J.F., Guenin, B.: Packing odd-circuits in Eulerian graphs. J. Comb. Theory Ser. B\u00a086(2), 280\u2013295 (2002)","journal-title":"J. Comb. Theory Ser. B"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Geelen, J.F., Gerards, A.M.H., Whittle, G.: Towards A Matroid-Minor Structure Theory. In: Combinatorics, Complexity, and Chance. A tribute to Dominic Welsh, pp. 72\u201382. Oxford University Press (2007)","DOI":"10.1093\/acprof:oso\/9780198571278.003.0005"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/BF01192523","volume":"15","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Ramakrishnan, V.S.: Minimizing Submodular Functions over Families of Sets. Combinatorica\u00a015, 499\u2013513 (1995)","journal-title":"Combinatorica"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer (1988)","DOI":"10.1007\/978-3-642-97881-4"},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0167-6377(81)90020-1","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Pulleyblank, W.R.: Weakly bipartite graphs and the max-cut problem. Operations Research Letters\u00a01(1), 23\u201327 (1981)","journal-title":"Operations Research Letters"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1006\/jctb.2001.2051","volume":"83","author":"B. Guenin","year":"2001","unstructured":"Guenin, B.: A characterization of weakly bipartite graphs. J. of Comb. Theory, Ser. B\u00a083(1), 112\u2013168 (2001)","journal-title":"J. of Comb. Theory, Ser. B"},{"issue":"4","key":"17_CR12","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1287\/moor.27.4.693.299","volume":"29","author":"B. Guenin","year":"2002","unstructured":"Guenin, B.: Integral polyhedra related to even-cycle and even-cut matroids. Math. Oper. Res.\u00a029(4), 693\u2013710 (2002)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1006\/jctb.2002.2127","volume":"86","author":"B. Guenin","year":"2002","unstructured":"Guenin, B.: A short proof of Semour\u2019s max-flow min-cut theorem. J. Comb. Theory Ser. B\u00a086(2), 273\u2013279 (2002)","journal-title":"J. Comb. Theory Ser. B"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K., Reed, B., Wollan, P.: The Graph Minor Algorithm with Parity Conditions. In: IEEE 52nd Annual Symposium Foundations of Computer Science, pp. 27\u201336 (2011)","DOI":"10.1109\/FOCS.2011.52"},{"key":"17_CR15","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","first-page":"101","volume-title":"Polyhedral Combinatorics","author":"A. Lehman","year":"1990","unstructured":"Lehman, A.: On the width-length inequality and degenerate projective planes. In: Cook, W., Seymour, P.D. (eds.) Polyhedral Combinatorics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a01, pp. 101\u2013105. American Mathematical Society, Providence (1990)"},{"key":"17_CR16","series-title":"Oxford Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566946.001.0001","volume-title":"Matroid theory","author":"J. Oxley","year":"2011","unstructured":"Oxley, J.: Matroid theory, 2nd edn. Oxford Graduate Texts in Mathematics, vol.\u00a021. Oxford University Press, Oxford (2011)","edition":"2"},{"key":"17_CR17","unstructured":"Pivotto, I.: Even-cycle and even-cut matroids. Ph.D thesis, University of Waterloo (2011)"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1006\/jctb.2001.2101","volume":"85","author":"A. Schrijver","year":"2002","unstructured":"Schrijver, A.: A short proof of Guenin\u2019s characterization of weakly bipartite graphs. Journal of Combinatorial Theory, Series B\u00a085, 255\u2013260 (2002)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0095-8956(77)90031-4","volume":"23","author":"P.D. Seymour","year":"1977","unstructured":"Seymour, P.D.: The matroids with the Max-Flow Min-Cut property. J. Combin. Theory Ser. B\u00a023, 189\u2013222 (1977)","journal-title":"J. Combin. Theory Ser. B"},{"key":"17_CR20","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0195-6698(81)80033-9","volume":"28","author":"P.D. Seymour","year":"1981","unstructured":"Seymour, P.D.: Matroids and multicommodity flows. European J. of Comb. 2\u00a028, 257\u2013290 (1981)","journal-title":"European J. of Comb. 2"},{"issue":"1","key":"17_CR21","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1287\/moor.12.1.72","volume":"12","author":"K. Truemper","year":"1987","unstructured":"Truemper, K.: Max-flow min-cut matroids: Polynomial testing and polynomial algorithms for maximum flow and shortest routes. Mathematics of Operations Research\u00a012(1), 72\u201396 (1987)","journal-title":"Mathematics of Operations Research"},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/0095-8956(89)90063-4","volume":"47","author":"T. Zaslavsky","year":"1989","unstructured":"Zaslavsky, T.: Biased graphs. I. Bias, balance, and gains. J. Comb. Theory Ser. B\u00a047, 32\u201352 (1989)","journal-title":"J. Comb. Theory Ser. B"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36694-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T13:41:52Z","timestamp":1557582112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36694-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642366932","9783642366949"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36694-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}