http://swrc.ontoware.org/ontology#TechnicalReport
Another Time-Complexity Analysis for Maximal Clique Enumeration Algorithm CLIQUES
en
The Advanced Algorithms Research Laboratory, The University of Electro-Communications
Department of Computer Science, University of Pisa
Etsuji Tomita
Alessio Conte
We revisit the maximal clique enumeration algorithm CLIQUES that appeared in Theoretical Computer Science 2006. It is proved to work in O (3n/3) -time in the worst-case for an n vertex graph. In this note, we extend the time-complexity analysis with respect to the number of maximal cliques, an issue that was left as an open problem since TCS 2006.
We revisit the maximal clique enumeration algorithm CLIQUES that appeared in Theoretical Computer Science 2006. It is proved to work in O (3n/3) -time in the worst-case for an n vertex graph. In this note, we extend the time-complexity analysis with respect to the number of maximal cliques, an issue that was left as an open problem since TCS 2006.
AN1009593X
研究報告アルゴリズム（AL）
2020-AL-178
7
1-8
2020-05-02
2188-8566