Gabow's algorithm (Nonnegative Weights Shortest Path (Directed Graphs))

From Algorithm Wiki

Revision as of 07: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 \log L/\log({2}+(E/V)))$

Space Complexity

$O(V+E)$? words

((keeping track of new graphs?))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

1983

Reference

https://ieeexplore.ieee.org/document/4568085

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Gabow%27s_algorithm_(Nonnegative_Weights_Shortest_Path_(Directed_Graphs))&oldid=46974"