Ford–Fulkerson algorithm (Bipartite Graph MCM Maximum Cardinality Matching)
Jump to navigation
Jump to search
Time Complexity
$O(VE)$
Space Complexity
$O(E)$ words
(creating new graph and using it as input to the Ford-Fulkerson algorithm)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1956