Course contentsShow
Computer Science
Lesson 1919 of 2,87243. Complexity TheoryPro lesson

The Independent Set Problem

Identifying a set of vertices with no edges between them and its NP-completeness.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.