标签： graph greedy
任何人都可以回答我这个找到图的最大独立集的方法的复杂性是什么？
Greedy(G): S = {} While G is not empty: Let v be a node with minimum degree in G S = union(S, {v}) remove v and its neighbors from G return S