Kazuhisa Makino, Takeaki Uno; Section 5 (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(n^{\omega})$ per clique where omega is the exponent on matrix multiplication

Space Complexity

$O(n^{2})$ words

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

Description

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Kazuhisa_Makino,_Takeaki_Uno;_Section_5_(Enumerating_Maximal_Cliques,_arbitrary_graph_Clique_Problems)&oldid=47417"