Ford & Fulkerson ( Maximum Flow)
Revision as of 11:32, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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")
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