Chan (Geometrically Weighted) (APSP on Geometrically Weighted Graphs All-Pairs Shortest Paths (APSP)): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(V^{2.{84}4})$ == Space Complexity == $O(l V^{2})$ words (Derived: Compute and store $2l$ $V \times V$ matrices) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2009 == Reference == http://tmc.web.engr.illinois.edu/moreapsp.pdf") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( | $O(n^{2.{84}4})$ | ||
== Space Complexity == | == Space Complexity == | ||
$O(l | $O(l n^{2})$ words | ||
(Derived: Compute and store $2l$ $V \times V$ matrices) | (Derived: Compute and store $2l$ $V \times V$ matrices) | ||
Latest revision as of 08:55, 10 April 2023
Time Complexity
$O(n^{2.{84}4})$
Space Complexity
$O(l n^{2})$ words
(Derived: Compute and store $2l$ $V \times V$ matrices)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2009