Dense APSP algorithm (Arbitrary edge weights, Dense graph Graph Diameter)

From Algorithm Wiki

Revision as of 12:17, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{3} / {2}^(logV)$^{0.5}) == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == - == Reference == -")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(V^{3} / {2}^(logV)$^{0.5})

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

-

Reference

-

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Dense_APSP_algorithm_(Arbitrary_edge_weights,_Dense_graph_Graph_Diameter)&oldid=45608"