This lesson is for subscribers
You've completed the free preview. Subscribe to unlock every lesson in every course.
Lesson 1918 of 2,872·43. Complexity TheoryPro lesson
The Clique Problem
Finding a complete subgraph of size k in a graph and proving it is NP-complete.