Chiba and Nishizeki (Enumerating Maximal Cliques, arbitrary graph Clique Problems)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(a(G)*m)$ per clique

Space Complexity

$O(m)$ words

(https://pdfs.semanticscholar.org/0d19/245a27bc65a87a8014d5b8a66fb514c8ff0b.pdf)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1985

Reference

https://pdfs.semanticscholar.org/0d19/245a27bc65a87a8014d5b8a66fb514c8ff0b.pdf

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Chiba_and_Nishizeki_(Enumerating_Maximal_Cliques,_arbitrary_graph_Clique_Problems)&oldid=47414"