Figure 3From: The maximum clique enumeration problem: algorithms, applications, and implementationsThe Essential Set (ES) Algorithm. The ES algorithm finds all essential vertices in a graph and removes their non-neighbors.Back to article page