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

Etsuji Tomita, Kohei Yoshida, Takuro Hatta, Atsuki Nagao, Hiro Ito, Mitsuo Wakatsuki

Browse the full FAW paper archive.