Matching problems with delta-matroid constraints

DOI10.1137/110860070MaRDI QIDQ3192172zbMATH OpenOpenAlexFDO

Authors Naonori Kakimura, Mizuyo Takamatsu

Publication date 26 September 2014

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/9ac9da39c1fc23a493c1b6d6cec8192cc4190a5c

zbMATH Keywords

polynomial-time algorithmdelta-matroidconstrained matchingmixed matrix theory

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The linear delta-matroid parity problem
• Coverings and delta-coverings
• Optimal matching forests and valuated delta-matroids
• Optimal matching forests and valuated delta-matroids
• The delta-sum of matching delta-matroids

Cited in

(7)

• Coverings and delta-coverings
• A polyhedral approach for a constrained matching problem
• Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection
• Optimal matching forests and valuated delta-matroids
• Optimal matching forests and valuated delta-matroids
• Even delta-matroids and the complexity of planar Boolean CSPs
• Even delta-matroids and the complexity of planar Boolean CSPs

This page was built for publication: Matching problems with delta-matroid constraints

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