Mucha; Sankowski (planar) (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 12:1412:14, 15 February 2023‎ Admin talk contribs‎ 547 bytes +547‎ Created page with "== Time Complexity == $O(V^{(\omega/{2})$}) where omega is the exponent on matrix multiplication == Space Complexity == $O(VlogV)$??? words (Paper mentions matrices with O(VlogV) nonempty entries; unclear if there are any other space-consuming objects (on first passthrough) as planar graphs only require O(V) space) == Description == == Approximate? == Exact == Randomized? == Yes, Monte Carlo == Model of Computation == Word RAM == Year == 2006 == Re..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Mucha;_Sankowski_(planar)_(Bipartite_Graph_MCM_Maximum_Cardinality_Matching)"