Recommendations
- Parity systems and the delta-matroid intersection problem
- Solving the linear matroid parity problem as a sequence of matroid intersection problems
- Algebraic algorithms for linear matroid parity problems
- Algebraic algorithms for linear matroid parity problems
- On the generalization of the matroid parity problem
- On the graphic matroid parity problem
- A weighted linear matroid parity algorithm
- A weighted linear matroid parity algorithm
- Delta-matroids for graph theorists
- Weighted linear matroid parity
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 3156382 (Why is no real title available?)
- scientific article; zbMATH DE number 4162893 (Why is no real title available?)
- scientific article; zbMATH DE number 3703542 (Why is no real title available?)
- scientific article; zbMATH DE number 3750968 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- An augmenting path algorithm for linear matroid parity
- Complexity of Matroid Property Algorithms
- Coverings and delta-coverings
- Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
- Greedy algorithm and symmetric matroids
- Matching theory
- Matrices and matroids for systems analysis
- Matroid matching and some applications
- Matroid matching via mixed skew-symmetric matrices
- Pseudomatroids
- Representability of \(\bigtriangleup\)-matroids over \(GF(2)\)
- Solving the linear matroid parity problem as a sequence of matroid intersection problems
- Some combinatorial properties of discriminants in metric vector spaces
Cited in
(22)- Non-commutative Edmonds' problem and matrix semi-invariants
- Matroid matching with Dilworth truncation
- Even delta-matroids and the complexity of planar Boolean CSPs
- Generalized Wong sequences and their applications to Edmonds' problems
- The parity problem of polymatroids without double circuits
- An augmenting path algorithm for linear matroid parity
- Delta-matroids whose twist polynomials are monomials
- Even delta-matroids and the complexity of planar Boolean CSPs
- Matching problems with delta-matroid constraints
- The Lazy Matroid Problem
- Weighted linear matroid parity
- Coverings and delta-coverings
- Parity systems and the delta-matroid intersection problem
- A weighted linear matroid parity algorithm
- Inductive tools for connected delta-matroids and multimatroids
- Optimal matching forests and valuated delta-matroids
- Optimal matching forests and valuated delta-matroids
- Matroids, delta-matroids and embedded graphs
- \(\Gamma\)-graphic delta-matroids and their applications
- On Planar Boolean CSP
- Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection
- On the Complexity of Holant Problems
This page was built for publication: The linear delta-matroid parity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1400971)
