"A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique."

Etsuji Tomita et al. (2010)
a service of Schloss Dagstuhl - Leibniz Center for Informatics