Maximum Clique Problem - Stanford Computer Science

This problem was the Maximal Clique Problem: given a group of vertices some of which have edges in between them, the maximal clique is the largest subset of ...

cs.stanford.edu