. Author manuscript; available in PMC: 2017 May 11.

Published in final edited form as: Discrete Appl Math. 2016 May 11;204:208–212. doi: 10.1016/j.dam.2015.11.010

Table 1.

Definitions used in this paper

term	meaning
G	a finite, simple, undirected graph
C	a maximum clique in G
k	the number of vertices in C
P	a paraclique as produced by Algorithm 1
p	the number of vertices in P
g	the glom term used in Algorithm 1
d(P)	the density of P