Kazuhisa Makino, Takeaki Uno; Section 6 (Enumerating Maximal Cliques, arbitrary graph Clique Problems)

Time Complexity

$O(delta^{4})$

Space Complexity

$O(n+m)$ auxiliary(?) words

(https://link.springer.com/chapter/10.1007/978-3-540-27810-8_23)

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2004

Reference

https://link.springer.com/chapter/10.1007/978-3-540-27810-8_23