Hungarian algorithm (Bipartite Maximum-Weight Matching Maximum-Weight 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 11:1511:15, 15 February 2023‎ Admin talk contribs‎ 464 bytes +464‎ Created page with "== Time Complexity == $O(n^{4})$ == Space Complexity == $O(n^{2})$ words (Either graph interpretation maintains O(n^2) orientations and O(n) potential or matrix interpretation manipulates an O(n)*O(n) auxiliary matrix) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1955 == Reference == https://web.eecs.umich.edu/~pettie/matching/Kuhn-hungarian-assignment.pdf"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Hungarian_algorithm_(Bipartite_Maximum-Weight_Matching_Maximum-Weight_Matching)"