Segundo; Artieda; Strash Parallel (Enumerating Maximal Cliques, arbitrary graph Clique Problems)
Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({3}^{(n/{3})})$ total work? (previously this cell said $O(n^{4})$) == Space Complexity == $O(n^{2})$ auxiliary?? words (Keep track of an O(n)-sized recursive stack with O(n)-sized lists as elements? (this algo builds off of Bron-Kerbosch)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2011 == Reference == https://arxiv.org/pdf/1801.00202.pdf")
Time Complexity
$O({3}^{(n/{3})})$ total work? (previously this cell said $O(n^{4})$)
Space Complexity
$O(n^{2})$ auxiliary?? words
(Keep track of an O(n)-sized recursive stack with O(n)-sized lists as elements? (this algo builds off of Bron-Kerbosch))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2011