Parallel algorithms for matroid intersection and matroid parity
From MaRDI portal
Publication:5261053
Recommendations
- Linear matroid intersection is in quasi-NC
- scientific article; zbMATH DE number 7768386
- Linear matroid intersection is in quasi-NC
- scientific article; zbMATH DE number 5888307
- A parameterized view on matroid optimization problems
- Two algorithms for weighted matroid intersection
- A Parameterized View on Matroid Optimization Problems
- Generalized matroid matching
- Algebraic algorithms for linear matroid parity problems
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
Cites work
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Division in logspace-uniform NC
- Matrix multiplication via arithmetic progressions
- Matroid matching via mixed skew-symmetric matrices
- NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
Cited in
(5)
This page was built for publication: Parallel algorithms for matroid intersection and matroid parity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261053)