General Graph MCM (Maximum Cardinality Matching)
Revision as of 10:20, 15 February 2023 by Admin (talk | contribs) (Created page with "{{DISPLAYTITLE:General Graph MCM (Maximum Cardinality Matching)}} == Description == The goal of maximum cardinality matching is to find a matching with as many edges as possible (equivalently: a matching that covers as many vertices as possible). Here, the graph can be any general graph. == Related Problems == Subproblem: Bipartite Graph MCM Related: Planar Bipartite Graph Perfect Matching == Parameters == <pre>V: number of vertices E: number of edges</p...")
Description
The goal of maximum cardinality matching is to find a matching with as many edges as possible (equivalently: a matching that covers as many vertices as possible). Here, the graph can be any general graph.
Related Problems
Subproblem: Bipartite Graph MCM
Related: Planar Bipartite Graph Perfect Matching
Parameters
V: number of vertices E: number of edges
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Micali and Vazirani | 1980 | $O(V^{0.5} E)$ | $O(V)$ | Deterministic | Time & Space | |
| Blum | 1990 | $O((V^{0.5})$E) | $O(E)$ auxiliary?? | Exact | Deterministic | Time |
| Gabow; Tarjan | 1991 | $O((V^{0.5})$E) | $O(E)$ auxiliary? | Exact | Deterministic | Time & Space |
| Mucha, Sankowski (general) | 2004 | $O(V^{2.{37}6})$ | $O(V^{2})$?? | Exact | Randomized | Time |
Time Complexity graph
Error creating thumbnail: Unable to save thumbnail to destination
Space Complexity graph
Error creating thumbnail: Unable to save thumbnail to destination
Pareto Decades graph
Error creating thumbnail: Unable to save thumbnail to destination