Blossom Algorithm (general graph Maximum cardinality matching): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 12:1812:18, 15 February 2023‎ Admin talk contribs‎ 498 bytes +498‎ 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..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Blossom_Algorithm_(general_graph_Maximum_cardinality_matching)"