|
|||||
|
|
An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments |
|
| Authors: | Etsuji Tomita Toshikatsu Kameda |
| Affiliation: | (1) Department of Information and Communication Engineering, The University of Electro-Communications, Chofugaoka 1-5-1, Chofu, Tokyo 182-8585, Japan |
| Abstract: | |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |