科研之友
微信
新浪微博
Facebook
分享链接
摘要
A clique of a graph is a vertex subset of which the vertices are pairwise adjacent. The maximum clique is a clique with the maximum size. The maximum clique problem consists of finding a maximum clique. It is well known that it is an NP-hard combinatorial optimization problem and it has a large number of applications. In this paper, we present a fast algorithm of the maximum clique problem for the transitive graphs. Experimental results show that the proposed algorithm performs very well for cyclic graphs which is a class of vertex transitive graphs. We suggest the approach be used to obtain upper bounds for clique numbers of graphs with large order or large size.
- 出版日期2014-7
- 单位西南政法大学
