Planar Bipartite Graph Perfect Matching: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 38: | Line 38: | ||
[[File:Maximum Cardinality Matching - Planar Bipartite Graph Perfect Matching - Space.png|1000px]] | [[File:Maximum Cardinality Matching - Planar Bipartite Graph Perfect Matching - Space.png|1000px]] | ||
== | == Space-Time Tradeoff Improvements == | ||
[[File:Maximum Cardinality Matching - Planar Bipartite Graph Perfect Matching - Pareto Frontier.png|1000px]] | [[File:Maximum Cardinality Matching - Planar Bipartite Graph Perfect Matching - Pareto Frontier.png|1000px]] | ||
Revision as of 14:36, 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 is a planar bipartite graph.
Related Problems
Generalizations: Bipartite Graph MCM
Related: General Graph MCM
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 | |
| Klein (section 5) | 1997 | $O(V^{({4}/{3})$} logV) | $O(V^{({4}/{3})$})? | Exact | Deterministic | Time |
Time Complexity Graph
Space Complexity Graph
Space-Time Tradeoff Improvements
