Introduction - If you have any usage issues, please Google them yourself
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.