| 关于最大团问题的一种新算法 |
| |
| 作者单位： | 温州大学城市学院 |
| |
| 摘 要： | 最大团问题是图论中重要的NP完全问题,目前求解最大团问题的方法只适合某些特殊的图,活则消耗时间长,求解效率低。该文提出了一种新的算法,蚁群算法来解决最大团问题。蚁群优化算法是一种基于自然启发的算法,是一种解决组合优化问题的有效方法。实验结果显示,算法的有效性。
|
| 关 键 词： | 最大团 组合优化 蚁群算法 |
A New Algorithm for the Maximum Clique Problem |
| |
| ZHOU Xiao-xiao,BAI Yang. A New Algorithm for the Maximum Clique Problem[J]. Digital Community & Smart Home, 2008, 0(22) |
| |
| Authors: | ZHOU Xiao-xiao BAI Yang |
| |
| Abstract: | The maximum clique problem is an important NP complete problem in graph theory.Prebious algorithms are either applicable only to some particular graphs or in need of exponential time cost. In this paper, an new algorithm-Ant Conlony Optimization(ACO) is presented,which is applied for MCP .ACO algorithm is a nature-inspired algorithm.It is an efficient tool for solving combinatorial optimization problem. Experimental results prove the effectiveness of the improvements. |
| |
| Keywords: | Maximum clique combinatorial optimization Ant Conlony Optimization |
| 本文献已被 CNKI 等数据库收录！ |
|
