A pivot vertex is selected from P or X to reduce branching in the pivoted Bron–Kerbosch algorithm. Rather than exploring every candidate in P, the algorithm explores only candidates that are not connected to the pivot. section 11.1
The pruning works because every maximal clique must either contain the pivot or include a vertex not connected to it:
- Choose a pivot from P ∪ X, then iterate over its non-neighbors in P. section 11.1
- Skipping the other candidates reduces redundant recursive calls, especially when dense graphs cause heavy branching. section 11.4
