Mucha, Sankowski (general) (General Graph MCM Maximum Cardinality Matching)
Revision as of 12:14, 15 February 2023 by Admin (talk | contribs) (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")
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