![]() | ![]() |
| 1997 | ||
|---|---|---|
| 1 | 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. Systems and Computers in Japan 28(5): 60-67 (1997) | |
| 1 | Yasuhiro Kohata | [1] |
| 2 | Etsuji Tomita | [1] |
| 3 | Mitsuo Wakatsuki | [1] |
Data released under the ODC-BY 1.0 license — See also our legal information page