Segundo; Artieda; Strash Parallel (Enumerating Maximal Cliques, arbitrary graph Clique Problems)
Jump to navigation
Jump to search
Time Complexity
$O({3}^{(n/{3})})$ total work? (previously this cell said $O(n^{4})$)
Space Complexity
$O(n^{2})$ auxiliary?? words
(Keep track of an O(n)-sized recursive stack with O(n)-sized lists as elements? (this algo builds off of Bron-Kerbosch))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2011