Tomita; Tanaka & Takahashi (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
2006
Reference
https://snap.stanford.edu/class/cs224w-readings/tomita06cliques.pdf