Tomita, Etsuji Sutani, Yoichi <br/><br/>
A Simple and Faster Branch-and-Bound Algorithm  for  Finding a Maximum Clique with  Computational Experiments 

 - 1286-1298 p. 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Maximum Clique<br/>Branch -and-Bound<br/>Approximate Coloring