On the exact matching problem in dense graphs
From MaRDI portal
Cites work
- A strongly polynomial algorithm for bimodular integer linear programming
- Advances on strictly \(\varDelta \)-modular IPs
- Algorithmic graph theory and perfect graphs
- Algorithmic meta-theorems for restrictions of treewidth
- Almost exact matchings
- An approximation algorithm for the exact matching problem in bipartite graphs
- An EPTAS for budgeted matching and budgeted matroid intersection via representative sets
- Approximation Algorithms for Bounded Color Matchings via Convex Decompositions
- Bi-criteria and approximation algorithms for restricted matchings
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Computational Complexity
- Constrained matching problems in bipartite graphs
- Counting the number of matchings in chordal and chordal bipartite graph classes
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Exact matching in graphs of bounded independence number
- Exact perfect matching in complete graphs
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 1559537 (Why is no real title available?)
- Integrality gaps for colorful matchings
- Matching is as easy as matrix inversion
- Matching structure and the matching lattice
- Matchings in colored bipartite networks
- Maximum matching of given weight in complete and complete bipartite graphs
- NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems
- On the theory of Pfaffian orientations. I: Perfect matchings and permanents
- Paths, Trees, and Flowers
- Planarizing Gadgets for Perfect Matching Do Not Exist
- PRIMES is in P
- Random pseudo-polynomial algorithms for exact matroid problems
- Solving linear equations parameterized by Hamming weight
- The complexity of restricted spanning tree problems
- The exact bipartite matching polytope has exponential extension complexity
- The matching problem in general graphs is in quasi-NC
This page was built for publication: On the exact matching problem in dense graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902691)
