Figure 2.
The pseudo-code for a single stage of the CLCL algorithm. At each stage, the heuristic algorithm tries to identify the clique with the largest size from the given unit-weighted, undirected graph. Notation: (vi, vj) denotes an edge connecting the vertices vi and vj; adj(vi) denotes the set of vertices that are adjacent to vertex v