Abstract
We present a depth-first search algorithm for generating all maximal cliques of an undirected graph, in which pruning methods are employed as in Bron and Kerbosch's algorithm. All maximal cliques generated are output in a tree-like form. Then we prove that its worst-case time complexity is O(3n/3) for an n-vertex graph. This is optimal as a function of n, since there exist up to 3n/3 cliques in an n-vertex graph. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Tomita, E., Tanaka, A., & Takahashi, H. (2004). The worst-case time complexity for generating all maximal cliques (extended abstract). Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3106, 161–170. https://doi.org/10.1007/978-3-540-27798-9_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
