Thorup (APSP on Dense Undirected Graphs with Positive Integer Weights; APSP on Sparse Undirected Graphs with Positive Integer Weights All-Pairs Shortest Paths (APSP))

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(mn)$

Space Complexity

$O(mn)$ words

(https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.22.7128&rep=rep1&type=pdf)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1999

Reference

http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.22.7128&rep=rep1&type=pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Thorup_(APSP_on_Dense_Undirected_Graphs_with_Positive_Integer_Weights;_APSP_on_Sparse_Undirected_Graphs_with_Positive_Integer_Weights_All-Pairs_Shortest_Paths_(APSP))&oldid=46981"