Clique
Input description: A graph G=(V,E), k
Problem description: Is there a subset S of V of size at least k such that for all x,y in S, (x,y) in E.
Optimization Version: Find maximum sized subset S.
Previous slide
Next slide
Back to first slide
View graphic version