基于验证和消元法的最大团问题快速启发式算法
A Fast Heuristic Algorithm Based on Verification and Elimination Methods for Maximum Clique Problem
摘要：
无向图G=（V，E）中的团是顶点的子集V' V，每对顶点由E中的一条边连接。团问题是在图中寻找一个最大团的优化问题。集团问题是NP完全的。本文采用验证消元法成功地发展了一种求解最大团问题的快速算法。对于大小为N的图，有2N个子图，它们可能是团，因此验证所有这些子图将花费很长时间。想法是消除大量的子图，这些子图不能是团，并且只验证剩余的子图。该启发式算法在多项式时间内运行，并成功地执行了几个例子时，应用于随机图和DIMACS基准图。
英文摘要：
A clique in an undirected graph G= (V, E) is a subset V' V of vertices, each pair of which is connected by an edge in E. The clique problem is an optimization problem of finding a clique of maximum size in graph. The clique problem is NP-Complete. We have succeeded in developing a fast algorithm for maximum clique problem by employing the method of verification and elimination. For a graph of size N there are 2N sub graphs, which may be cliques and hence verifying all of them, will take a long time. Idea is to eliminate a major number of sub graphs, which cannot be cliques and verifying only the remaining sub graphs. This heuristic algorithm runs in polynomial time and executes successfully for several examples when applied to random graphs and DIMACS benchmark graphs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
