| 摘要: |
| 图的最大团问题是一个著名的ＮＰ－完全问题．现有求解图的最大团的算法或者只适用于某些特殊的图，或者需要指数级时间代价，效率较低．以图的区间表示的概念为基础，提出了一种求解最大团的算法．该算法能够适用于任意的简单图，并且在一定的条件下，该算法只需要多项式时间就可以完成运行. |
| 关键词: 图论 图论算法 可计算性 NP问题 集团 |
| DOI： |
| 分类号: |
| 基金项目:本文研究得到国家攀登计划基金资助. |
|
| An Algorithm Computing the Maximum Clique in a Graph |
|
ZHONG Sheng,XIE Li
|
| Abstract: |
| The maximum clique problem is a wellknown NPcomplete problem. Previous algorithms are either applicable only to some particular graphs or in need of exponential time cost. In this paper, an algorithm is presented, which computes the maximum clique(s) based on the notion of interval representation of a graph. It can be applied to any simple graph and only needs polynomial time under the certain conditions. |
| Key words: Graph theory graph theory algorithms computability NPproblem clique |
