机译:计算实验中找到最大团的简单快速分支定界算法
Advanced Algorithms Research Laboratory, The University of Electro-Communications, Chofu-shi,182-8585 Japan JST ERATO Minato Discrete Structure Manipulation System Project, Sapporo-shi, 060-0814 Japan Tokyo Institute of Technology, Tokyo,152-8550 Japan;
Advanced Algorithms Research Laboratory, The University of Electro-Communications, Chofu-shi,182-8585 Japan Sony Corporation, Atsugi-shi, 243-0014 Japan;
Advanced Algorithms Research Laboratory, The University of Electro-Communications, Chofu-shi,182-8585 Japan Japan Systems Co., Ltd., Tokyo, 151-8404 Japan;
Advanced Algorithms Research Laboratory, The University of Electro-Communications, Chofu-shi,182-8585 Japan. Graduate School of Informatics and Engineering, The University of Electro-Communications, Chofu-shi, 182-8585 Japan;
maximum clique; branch-and-bound; approximate coloring; computational experiments;
机译:计算实验中找到最大团的简单快速分支定界算法
机译:一种高效的分支定界算法,可通过计算实验找到最大集团
机译:寻找最大派系的快速分支定界算法
机译:寻找最大派系的简单快速分支定界算法
机译:在凸二分图中找到最大边基数双斜率的快速算法。
机译:一种新的快速算法可使用最大兼容群体检测蛋白质协同进化
机译:一种简单快速的分支定界算法,可通过计算实验找到最大团团