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

DOI10.1016/0166-218X(86)90052-1zbMATH Open0679.90052MaRDI QIDQ1823147FDOQ1823147

Authors: F. T. Tseng, Klaus Truemper 

Publication date: 1986

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

Recommendations

• The matroids with the max-flow min-cut property
• Addendum to ``A decomposition of the matroids with the max-flow min-cut property
• A note on maxflow-mincut and homomorphic equivalence in matroids
• scientific article; zbMATH DE number 2086922
• A short proof of Seymour's characterization of the matroids with the max-flow min-cut property
• A generalized cut-condition for multiflows in matroids
• A short proof of the Truemper-Tseng theorem on max-flow min-cut matroids
• scientific article; zbMATH DE number 952954
• scientific article; zbMATH DE number 7740924
• scientific article; zbMATH DE number 4207199

zbMATH Keywords

matroiddecomposition algorithmmax-flow min-cut propertycircuit packingminimal forbidden minors

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (20)

• A short proof of Seymour's characterization of the matroids with the max-flow min-cut property
• A decomposition of the matroids with the max-flow min-cut property
• Recognizing max-flow min-cut path matrices
• A decomposition theory for matroids. IV: Decomposition of graphs
• Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes
• The max-flow min-cut property of two-dimensional affine convex geometries
• On fixing elements in matroid minors
• A short proof of the Truemper-Tseng theorem on max-flow min-cut matroids
• A decomposition theory for matroids. III. Decomposition conditions
• A decomposition theory for matroids. VI: Almost regular matroids
• Compositions for matroids with the Fulkerson property
• On fixing edges in graph minors
• The matroids with the max-flow min-cut property
• Even-cycle decompositions of graphs with no odd-\(K_4\)-minor
• Generalizing the all-pairs min cut problem
• Degree Bounded Matroids and Submodular Flows
• Title not available (Why is that?)
• A note on roundedness in 4-connected matroids
• Triangles in 3-connected matroids
• Graphs with no \(K_{3,3}\) minor containing a fixed edge

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823147)