Dantzig ( Maximum Flow): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(V^{2}EU)$ == Space Complexity == $O(VE)$? words (can be derived? (assuming this is referring to simplex algorithm)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1951 == Reference ==") |
No edit summary |
||
| Line 7: | Line 7: | ||
$O(VE)$? words | $O(VE)$? words | ||
( | (Assuming this is referring to translating maximum flow into linear programming and using the simplex algorithm, this requires $O(VE)$ space.) | ||
== Description == | == Description == | ||
Latest revision as of 08:33, 10 April 2023
Time Complexity
$O(V^{2}EU)$
Space Complexity
$O(VE)$? words
(Assuming this is referring to translating maximum flow into linear programming and using the simplex algorithm, this requires $O(VE)$ space.)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1951