**CLIQUE:** Given graph
*G* = (*V*, *E*), find largest subset
such that
,
.

I.e., *V*' forms a complete subgraph of *G* (usually want largest).

CLIQUE = of size and ,

**Example**

The running time of the CLIQUE algorithm is