Tomita; Tanaka & Takahashi (Enumerating Maximal Cliques, arbitrary graph Clique Problems): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O({3}^{(n/{3})$}) == Space Complexity == $O(n^{2})$ auxiliary? 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") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O(n^{2})$ | $O(n^{2})$? words | ||
(See Bron-Kerbosch (seems like a similar approach?)) | (See Bron-Kerbosch (seems like a similar approach?)) | ||
Latest revision as of 08:43, 10 April 2023
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