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

From Algorithm Wiki
Revision as of 10:37, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(E logL/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.ezproxy.canberra.edu.au/document/4568085")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(E logL/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.ezproxy.canberra.edu.au/document/4568085

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