Approximation algorithms for maximum matchings in undirected graphs
From MaRDI portal
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Recommendations
- New approximation results on graph matching and related problems
- A new approach to maximum matching in general graphs
- Approximating matchings in parallel
- A simpler linear time \( \frac{2}{3} - \varepsilon\) approximation for maximum weight matching
- Linear-time approximation for maximum weight matching
This page was built for publication: Approximation algorithms for maximum matchings in undirected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6539156)