Ford & Fulkerson ( Maximum Flow)
Jump to navigation
Jump to search
Time Complexity
$O(E^{2}U)$
Space Complexity
$O(E)$ words
(https://core.ac.uk/download/pdf/81946904.pdf)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1955
Reference
http://www.cs.yale.edu/homes/lans/readings/routing/ford-max_flow-1956.pdf