Skip to main content
. Author manuscript; available in PMC: 2015 Jan 1.
Published in final edited form as: Int J Bioinform Res Appl. 2014;10(4):479–497. doi: 10.1504/IJBRA.2014.062996

Figure 2.

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