Get Math Help

GET TUTORING NEAR ME!

By submitting the following form, you agree to Club Z!'s Terms of Use and Privacy Policy

    Maximum Independent Set Problem

    Definition

    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.

    Find the right fit or it’s free.

    We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.