@article{oai:uec.repo.nii.ac.jp:00009653,
 author = {TOMITA, Etsuji and CONTE, Alessio},
 journal = {IEICE Technical Report},
 month = {May},
 note = {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.},
 pages = {1--8},
 title = {Another Time-Complexity Analysis for Maximal Clique Enumeration Algorithm CLIQUES},
 volume = {COMP2020-1(2020-05)},
 year = {2020}
}