Etsuji Tomita Ken'ichi Imamatsu Yasuhiro Kohata Mitsuo Wakatsuki A simple and efficient branch and bound algorithm for finding a maximum clique with experimental evaluations. 60-67 1997 28 Systems and Computers in Japan 5 http://dx.doi.org/10.1002/(SICI)1520-684X(199705)28:5<60::AID-SCJ7>3.0.CO;2-M db/journals/scjapan/scjapan28.html#TomitaIKW97