A note on the separation problem for the matching matroid

DOI10.1016/0012-365X(84)90094-3zbMATH Open0555.05024OpenAlexW2071484462MaRDI QIDQ760436FDOQ760436

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

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

zbMATH Keywords

digraphseparation problemmatching matroidminimum-capacity cut

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Paths, Trees, and Flowers
• Transversals and matroid partition
• Title not available (Why is that?)

Cited In (8)

• The disjunctive procedure on the matching problem
• On some algorithmic aspects of hypergraphic matroids
• Title not available (Why is that?)
• Characterizing matchings as the intersection of matroids
• Facets of the independent path-matching polytope
• A note on matchings and separability
• Separation par une droite dans les matroïdes orientés de rang 3. (Separation of oriented matroids of rang 3 by a line)
• Bridging Separations in Matroids

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)