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.
We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.