Skip to content

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

Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Shinya Takahashi, Mitsuo Wakatsuki

VenueBWALCOM
Year2010
ProceedingsWALCOM

Browse the full WALCOM paper archive.