Thorup's algorithm (Nonnegative Integer 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 + V min(log log V, log log L))$ == Space Complexity == $O(V)$? ("linear-space queue") words (https://dl.acm.org/doi/10.1016/j.jcss.2004.04.003) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 2004 == Reference == https://dl.acm.org/doi/10.1016/j.jcss.2004.04.003")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(E + V min(log log V, log log L))$

Space Complexity

$O(V)$? ("linear-space queue") words

(https://dl.acm.org/doi/10.1016/j.jcss.2004.04.003)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

2004

Reference

https://dl.acm.org/doi/10.1016/j.jcss.2004.04.003

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