Chan (Geometrically Weighted) (APSP on Geometrically Weighted Graphs All-Pairs Shortest Paths (APSP)): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

10 April 2023

15 February 2023

  • curprev 11:3811:38, 15 February 2023‎ Admin talk contribs‎ 354 bytes +354‎ 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"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Chan_(Geometrically_Weighted)_(APSP_on_Geometrically_Weighted_Graphs_All-Pairs_Shortest_Paths_(APSP))"