【摘要】 如何寻找图的最大独立集这个问题是一个古老的难题。文章从图论的基本概念入手 ,得到了一种基于图的邻接矩阵的寻找图的极大独立集和最大独立集的算法 ,并得到其算法复杂度为 O(nn!/(m!(n - m) !) )更多还原

【Abstract】 It is very hard to find out the maximal independent set in a graph for a Long time.The article begins with the basic concept of graph theory,and set up an algorithm to find out the maximal independent set and maximum independent set of a graph on the basis of critical matrix of graph,and its complexity is O(nn!/(m!(n-m)!)).更多还原