A note on the separation problem for the matching matroid

DOI10.1016/0012-365X(84)90094-3MaRDI QIDQ760436zbMATH OpenOpenAlexFDO

Authors A. Prodon

Publication date 1984

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(84)90094-3

zbMATH Keywords

digraphmatching matroidminimum-capacity cutseparation problem

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20)

Recommendations

• A separation algorithm for the matchable set polytope
• scientific article; zbMATH DE number 3150
• Characterizing matchings as the intersection of matroids
• Publication:3199198
• On matroid parity and matching polytopes

Cites work

• scientific article; zbMATH DE number 3749025 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• Paths, Trees, and Flowers
• Transversals and matroid partition

Cited in

(11)

• Separation par une droite dans les matroïdes orientés de rang 3. (Separation of oriented matroids of rang 3 by a line)
• The optimal path-matching problem
• A separation algorithm for the matchable set polytope
• Characterizing matchings as the intersection of matroids
• On some algorithmic aspects of hypergraphic matroids
• Facets of the independent path-matching polytope
• The disjunctive procedure on the matching problem
• scientific article; zbMATH DE number 4174676 (Why is no real title available?)
• On the geometric rank of matching polytope
• Bridging Separations in Matroids
• A note on matchings and separability

This page was built for publication: A note on the separation problem for the matching matroid

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