Akkoyunlu; E. A. (Enumerating Maximal Cliques, arbitrary graph Clique Problems)
Jump to navigation
Jump to search
Time Complexity
$O({3}^{(n/{3})$})
Space Complexity
$O(n^{2})$? words
(See Bron-Kerbosch (seems like a similar approach?))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1973
Reference
http://www.dcs.gla.ac.uk/~pat/jchoco/clique/enumeration/papers/SMJ000001%5B1%5D.pdf