PineWikiThe INDEPENDENT SET problem takes as input a graph G = (V,E) and a bound k, and asks if there is a set of k vertices of G such that no two vertices in the set are adjacent. It is known to be NP-complete (see PvsNp).
The INDEPENDENT SET problem takes as input a graph G = (V,E) and a bound k, and asks if there is a set of k vertices of G such that no two vertices in the set are adjacent. It is known to be NP-complete (see PvsNp).
IndependentSet (last edited 2007-12-25 23:42:22 by localhost)
