算法分析与设计 最大团问题 G的最大团是指G中所含顶点数最多的团。

无向图的最大团和最大独立集问题都可以看作是图G的顶点集V的

子集选取问题可以用回溯法在O(n*(2^n))时间内解决。-Algorithm analysis and design problem G, the biggest group the biggest group is the maximum number of vertices of G contained in the group. Undirected graph of maximum clique and maximum independent set problem can be regarded as the vertex set V G is a subset selection problem can be backtracking in O (n* (2 ^ n)) time to solve.