Let’s show the following problems are NP-complete

• Clique

• Independent Set

• Travelling Salesman Problem

Previous slide

Next slide

Back to first slide

View graphic version