The linear delta-matroid parity problem

DOI10.1016/S0095-8956(03)00039-XzbMath1021.05019MaRDI QIDQ1400971

Satoru Iwata, Kazuo Murota, James F. Geelen

Publication date: 17 August 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

delta-matroidsaugmenting path algorithmminimax theorem of Lovász

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

On Planar Boolean CSP ⋮ Non-commutative Edmonds' problem and matrix semi-invariants ⋮ Delta-matroids whose twist polynomials are monomials ⋮ On the Complexity of Holant Problems ⋮ A Weighted Linear Matroid Parity Algorithm ⋮ Matroid matching with Dilworth truncation ⋮ Unnamed Item ⋮ Matroids, delta-matroids and embedded graphs ⋮ Generalized Wong sequences and their applications to Edmonds' problems ⋮ Inductive tools for connected delta-matroids and multimatroids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some combinatorial properties of discriminants in metric vector spaces
• An augmenting path algorithm for linear matroid parity
• Matching theory
• Pseudomatroids
• Matroid matching and some applications
• Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
• Solving the linear matroid parity problem as a sequence of matroid intersection problems
• Matroid matching via mixed skew-symmetric matrices
• Greedy algorithm and symmetric matroids
• Complexity of Matroid Property Algorithms
• Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
• Coverings and delta-coverings
• Matrices and matroids for systems analysis