David Eppstein, Maarten Löffler, Darren Strash (Enumerating Maximal Cliques, arbitrary graph Clique Problems): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(dn {3}^{(d/{3})})$ == Space Complexity == $O(n^{2})$ auxiliary? 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 == Reference == https://arxiv.org/pdf/1006.5440.pdf") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O(n^{2})$ | $O(n^{2})$? words | ||
(See Bron-Kerbosch, but also keeps track of O(n)-sized degeneracy ordering) | (See Bron-Kerbosch, but also keeps track of O(n)-sized degeneracy ordering) | ||
Latest revision as of 08:43, 10 April 2023
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