Chan (APSP on Dense Directed Graphs with Arbitrary Weights; APSP on Dense Undirected Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP))
Jump to navigation
Jump to search
Time Complexity
$O(n^{3} \log^{3} \log n / \log^{2} n)$
Space Complexity
$O(n^{2})$ words
(Derived: Dividing $A$ and $B$ into $V \times q$ and $q \times V$ matrices, in total using $O(V^2)$ space )
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2009