M. Chrobak and D. Eppstein (Enumerating Maximal Cliques, arbitrary graph Clique Problems): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n d^{2} {2}^d)$ == Space Complexity == $O(n)$ auxiliary? words (Keeps track of degeneracy ordering along with vertex and subset being tested (here the subset size is bounded by O(d)=O(n))) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1989 == Reference == https://www.ics.uci.edu/~eppstein/pubs/ChrEpp-TCS-91.pdf") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O(n)$ | $O(n)$? words | ||
(Keeps track of degeneracy ordering along with vertex and subset being tested (here the subset size is bounded by O(d)=O(n))) | (Keeps track of degeneracy ordering along with vertex and subset being tested (here the subset size is bounded by O(d)=O(n))) | ||
Latest revision as of 09:43, 10 April 2023
Time Complexity
$O(n d^{2} {2}^d)$
Space Complexity
$O(n)$? words
(Keeps track of degeneracy ordering along with vertex and subset being tested (here the subset size is bounded by O(d)=O(n)))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1989