Chan (APSP on Dense Directed Graphs with Arbitrary Weights; APSP on Dense Undirected Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP))
Revision as of 10:38, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{3} \log^{3} \log V / \log^{2} V)$ == Space Complexity == $O(V^{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 == Reference == http://tmc.web.engr.illinois.edu/moreapsp.pdf")
Time Complexity
$O(V^{3} \log^{3} \log V / \log^{2} V)$
Space Complexity
$O(V^{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