Bron–Kerbosch algorithm (Enumerating Maximal Cliques, arbitrary graph Clique Problems)
Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({3}^{(n/{3})})$ == Space Complexity == $O(n^{2})$ auxiliary? words (Keep track of an O(n)-sized recursive stack with O(n)-sized lists as elements?) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1973 == Reference == https://dl.acm.org/doi/10.1145/362342.362367")
Time Complexity
$O({3}^{(n/{3})})$
Space Complexity
$O(n^{2})$ auxiliary? words
(Keep track of an O(n)-sized recursive stack with O(n)-sized lists as elements?)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1973