David Eppstein, Maarten Löffler, Darren Strash (Enumerating Maximal Cliques, arbitrary graph Clique Problems)
Jump to navigation
Jump to search
Time Complexity
$O(dn {3}^{(d/{3})})$
Space Complexity
$O(n^{2})$? words
(See Bron-Kerbosch, but also keeps track of O(n)-sized degeneracy ordering)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2010