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

From Algorithm Wiki
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