Brute force enumeration (k-Clique k-Clique Problem)
Jump to navigation
Jump to search
Time Complexity
$O(n^k)$
Space Complexity
$O(k)$ auxiliary words
(keeping track of which vertices we're looking at)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
-
Reference
-