A decomposition of the matroids with the max-flow min-cut property

DOI10.1016/0166-218X(86)90052-1zbMath0679.90052MaRDI QIDQ1823147

F. T. Tseng, Klaus Truemper

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

max-flow min-cut propertymatroiddecomposition algorithmcircuit packingminimal forbidden minors

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (13)

A decomposition theory for matroids. III. Decomposition conditions ⋮ Compositions for matroids with the Fulkerson property ⋮ A decomposition theory for matroids. IV: Decomposition of graphs ⋮ Generalizing the all-pairs min cut problem ⋮ On fixing edges in graph minors ⋮ Even-cycle decompositions of graphs with no odd-\(K_4\)-minor ⋮ On fixing elements in matroid minors ⋮ A short proof of the Truemper-Tseng theorem on max-flow min-cut matroids ⋮ Graphs with no \(K_{3,3}\) minor containing a fixed edge ⋮ Triangles in 3-connected matroids ⋮ A note on roundedness in 4-connected matroids ⋮ A decomposition theory for matroids. VI: Almost regular matroids ⋮ A decomposition of the matroids with the max-flow min-cut property

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A decomposition theory for matroids. I: General results
• A decomposition theory for matroids. II. Minimal violation matroids
• A decomposition theory for matroids. III. Decomposition conditions
• Decomposition of regular matroids
• The dependence graph for bases in matroids
• The matroids with the max-flow min-cut property
• Local unimodularity of matrix-vector pairs
• A decomposition of the matroids with the max-flow min-cut property
• Partial matroid representations
• Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes
• Connectivity in Matroids

This page was built for publication: A decomposition of the matroids with the max-flow min-cut property