Algorithm 4:

Clique-based selection

1. Form graph G based on (4.3).

2. Form $\mathcal{Q}$, the set of all vertex sets that form a maximal clique in G. Each vertex set is initialized with a child set equal to itself.

3. While there exists a pair of vertex sets $A,B\in \mathcal{Q}$ that the algorithm has not tried yet:

(a) Determine if C = A ∪ B forms a γ-quasi-clique in G. If so, add C as a new vertex set into $\mathcal{Q}$, with A and B as its two children sets.

4. Return the largest vertex set in $\mathcal{Q}$.