Tomita; Tanaka & Takahashi (Enumerating Maximal Cliques, arbitrary graph Clique Problems)

From Algorithm Wiki
Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({3}^{(n/{3})$}) == Space Complexity == $O(n^{2})$ auxiliary? words (See Bron-Kerbosch (seems like a similar approach?)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2006 == Reference == https://snap.stanford.edu/class/cs224w-readings/tomita06cliques.pdf")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O({3}^{(n/{3})$})

Space Complexity

$O(n^{2})$ auxiliary? words

(See Bron-Kerbosch (seems like a similar approach?))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2006

Reference

https://snap.stanford.edu/class/cs224w-readings/tomita06cliques.pdf

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Tomita;_Tanaka_%26_Takahashi_(Enumerating_Maximal_Cliques,_arbitrary_graph_Clique_Problems)&oldid=45408"