General Graph MCM: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 34: | Line 34: | ||
|} | |} | ||
== Time Complexity | == Time Complexity Graph == | ||
[[File:Maximum Cardinality Matching - General Graph MCM - Time.png|1000px]] | [[File:Maximum Cardinality Matching - General Graph MCM - Time.png|1000px]] | ||
== Space Complexity | == Space Complexity Graph == | ||
[[File:Maximum Cardinality Matching - General Graph MCM - Space.png|1000px]] | [[File:Maximum Cardinality Matching - General Graph MCM - Space.png|1000px]] | ||
== Pareto | == Pareto Frontier Improvements Graph == | ||
[[File:Maximum Cardinality Matching - General Graph MCM - Pareto Frontier.png|1000px]] | [[File:Maximum Cardinality Matching - General Graph MCM - Pareto Frontier.png|1000px]] | ||
Revision as of 14:04, 15 February 2023
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
Space Complexity Graph
Pareto Frontier Improvements Graph
