An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. - Etsuji Tomita; Toshikatsu Kameda (J. Glob. Optim., 2009)