Zwick 2002 (Directed, Unweighted All-Pairs Shortest Paths (APSP))

From Algorithm Wiki
Revision as of 12:17, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{2.575})$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2002 == Reference == https://dl.acm.org/doi/abs/10.1145/567112.567114")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(V^{2.575})$

Space Complexity

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

2002

Reference

https://dl.acm.org/doi/abs/10.1145/567112.567114

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Zwick_2002_(Directed,_Unweighted_All-Pairs_Shortest_Paths_(APSP))&oldid=45619"