Blossom Algorithm (general graph Maximum cardinality matching)
Jump to navigation
Jump to search
Time Complexity
$O(V^{2}E)$
Space Complexity
$O(E)$ auxiliary? words
(Manipulates a constant number of graphs? Contractions can be kept track of in O(E) space)
Description
Approximate?
Approximate
Approximation Factor:
Randomized?
Yes,
Model of Computation
Word RAM
Year
1961