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).
[FrontPage] [TitleIndex] [WordIndex]
Note: You are looking at a static copy of the former PineWiki site, used for class notes by James Aspnes from 2003 to 2012. Many mathematical formulas are broken, and there are likely to be other bugs as well. These will most likely not be fixed. You may be able to find more up-to-date versions of some of these notes at http://www.cs.yale.edu/homes/aspnes/#classes.