Gabow Ahuja Algorithm (Nonnegative Integer Weights Shortest Path (Directed Graphs))

From Algorithm Wiki

Revision as of 08:55, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

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

Reference

https://dl.acm.org/doi/10.1145/77600.77615

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Gabow_Ahuja_Algorithm_(Nonnegative_Integer_Weights_Shortest_Path_(Directed_Graphs))&oldid=46975"