Gabow Ahuja Algorithm (Nonnegative Integer Weights Shortest Path (Directed Graphs)): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(E + V*((log(L))^{0.5}) )$ == Space Complexity == $O(m + log C)$ words (https://dl.acm.org/doi/10.1145/77600.77615) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1990 == Reference == https://dl.acm.org/doi/10.1145/77600.77615") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(E + V*((log(L))^{0.5}) )$ | $O(E + V*((\log(L))^{0.5}) )$ | ||
== Space Complexity == | == Space Complexity == | ||
$O( | $O(E + \log C)$ words | ||
(https://dl.acm.org/doi/10.1145/77600.77615) | (https://dl.acm.org/doi/10.1145/77600.77615) | ||
Latest revision as of 08:55, 10 April 2023
Time Complexity
$O(E + V*((\log(L))^{0.5}) )$
Space Complexity
$O(E + \log C)$ words
(https://dl.acm.org/doi/10.1145/77600.77615)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1990