Blossom Algorithm (general graph Maximum cardinality matching)
Revision as of 12:18, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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 == Reference == https://www.cambridge.org/core/journals/canadian-journal-of-mathematics/article/paths-trees-and-flowers/08B492B72...")
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