Problems on group-labeled matroid bases
From MaRDI portal
Cites work
- -graphic delta-matroids and their applications
- A generalization of Kneser's addition theorem
- A new contraction technique with applications to congruency-constrained cuts
- A PRIMAL APPROACH TO THE INDEPENDENT ASSIGNMENT PROBLEM
- A strongly polynomial algorithm for bimodular integer linear programming
- A weighted matroid intersection algorithm
- Almost exact matchings
- An infinite family of excluded minors for strong base-orderability
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Comments on bases in dependence structures
- Complexity of packing common bases in matroids
- Congruency-constrained TU problems beyond the bimodular case
- Connections in combinatorial optimization
- Determinant of three-layer Toeplitz matrices
- Exact arborescences, matchings and cycles
- Exact matching: correct parity and FPT parameterized by independence number
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Finding a path with two labels forbidden in group-labeled graphs
- Finding a shortest non-zero path in group-labeled graphs
- Graph theory
- Greedy algorithm and symmetric matroids
- scientific article; zbMATH DE number 4214018 (Why is no real title available?)
- scientific article; zbMATH DE number 4047093 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3698383 (Why is no real title available?)
- Lower bounds for matroid optimization problems with a linear constraint
- Matching is as easy as matrix inversion
- Matching structure and the matching lattice
- On Disjoint Common Bases in Two Matroids
- On the complexity of computing determinants
- On the complexity of packing rainbow spanning trees
- Packing non-zero \(A\)-paths in group-labelled graphs
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
- Random bichromatic matchings
- Random pseudo-polynomial algorithms for exact matroid problems
- Submodular minimization under congruency constraints
- The complexity of restricted spanning tree problems
- The dependence graph for bases in matroids
- The even-path problem for graphs and digraphs
- The exact bipartite matching polytope has exponential extension complexity
- The lattices of matroid bases and exact matroid bases
- The matching problem in general graphs is in quasi-NC
- Two algorithms for weighted matroid intersection
- Unavoidable minors of large 3-connected binary matroids
- Weight distribution of the bases of a matroid
Cited in
(4)
This page was built for publication: Problems on group-labeled matroid bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875110)
