Bron–Kerbosch algorithm (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
(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.ezproxy.canberra.edu.au/doi/10.1145/362342.362367