The maximum independent set problem seeks to find a maximum independent vertex set, i.e., an independent vertex set of maximum possible size (i.e., with size equal to the independence number), in a given graph. The problem is NP-complete.

independence number | independent set | independent vertex set | maximum independent vertex set