Mucha, Sankowski (general) (General 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.

    15 February 2023

    • curprev 12:1412:14, 15 February 2023‎ Admin talk contribs‎ 365 bytes +365‎ Created page with "== Time Complexity == $O(V^{2.{37}6})$ == Space Complexity == $O(V^{2})$?? words (Algorithm uses/manipulates constant number of matrices and graphs?) == Description == == Approximate? == Exact == Randomized? == Yes, Monte Carlo == Model of Computation == Word RAM == Year == 2004 == Reference == https://ieeexplore.ieee.org/document/1366244"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Mucha,_Sankowski_(general)_(General_Graph_MCM_Maximum_Cardinality_Matching)"