A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments
The worst-case time complexity for generating all maximal cliques and computational experiments