David Eppstein, Maarten Löffler, Darren Strash (Enumerating Maximal Cliques, arbitrary graph Clique Problems)

From Algorithm Wiki

Revision as of 08:43, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

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

Reference

https://arxiv.org/pdf/1006.5440.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=David_Eppstein,_Maarten_Löffler,_Darren_Strash_(Enumerating_Maximal_Cliques,_arbitrary_graph_Clique_Problems)&oldid=47413"