Thorup (positive integer weights; assumes constant-time multiplication Shortest Path (Undirected graphs))

From Algorithm Wiki
Revision as of 10:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(E)$ == Space Complexity == $O(E)$ words (https://dl.acm.org/doi/10.1145/316542.316548) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1999 == Reference == https://dl.acm.org/doi/10.1145/316542.316548")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(E)$

Space Complexity

$O(E)$ words

(https://dl.acm.org/doi/10.1145/316542.316548)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1999

Reference

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Thorup_(positive_integer_weights;_assumes_constant-time_multiplication_Shortest_Path_(Undirected_graphs))&oldid=45088"