APSP algorithm (3-Clique Min-Weight k-Clique Problem)
Jump to navigation
Jump to search
Time Complexity
$O(n^{3} / {2}^(log n)$^{0.5})
Space Complexity
words
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
-
Reference
-