![](/img/cover-not-exists.png)
An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
Etsuji Tomita, Toshikatsu KamedaVolume:
44
Language:
english
Pages:
1
DOI:
10.1007/s10898-008-9362-2
Date:
June, 2009
File:
PDF, 95 KB
english, 2009