Chandran and Hochbaum (Bipartite Graph MCM Maximum Cardinality Matching)
Revision as of 12:14, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(min(V*k, E)$+sqrt(k)*min(k^{2}, E)) == Space Complexity == $O(E)$ auxiliary?? words (Designs a flow network and runs pseudoflow algorithms on graph; space can be reused if too many residual graphs are created) == Description == == Approximate? == Exact == Randomized? == Yes, == Model of Computation == Word RAM == Year == 2011 == Reference == https://arxiv.org/abs/1105.1569")
Time Complexity
$O(min(V*k, E)$+sqrt(k)*min(k^{2}, E))
Space Complexity
$O(E)$ auxiliary?? words
(Designs a flow network and runs pseudoflow algorithms on graph; space can be reused if too many residual graphs are created)
Description
Approximate?
Exact
Randomized?
Yes,
Model of Computation
Word RAM
Year
2011