Zwick 2002 (Directed, Unweighted All-Pairs Shortest Paths (APSP))
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.ezproxy.canberra.edu.au/doi/abs/10.1145/567112.567114