Hopcroft–Karp algorithm (Bipartite Graph MCM 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.

10 April 2023

15 February 2023

  • curprev 11:1411:14, 15 February 2023‎ Admin talk contribs‎ 432 bytes +432‎ Created page with "== Time Complexity == $O((V^{0.5})$E) == Space Complexity == $O(V)$ auxiliary words (maximal set of vertex-disjoint shortest augmenting paths uses O(V) space to store, taking symmetric difference also uses O(V) space) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1973 == Reference == https://epubs-siam-org.ezproxy.canberra.edu.au/doi/10.1137/0202019"
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Hopcroft–Karp_algorithm_(Bipartite_Graph_MCM_Maximum_Cardinality_Matching)"