Figure 2From: The maximum clique enumeration problem: algorithms, applications, and implementationsIntelligent Backtracking. A minor change to the Bron-Kerbosch algorithm uses the precomputed maximum clique size to trim the recursion tree. The input graph has typically been reduced using color preprocessing. %endfigure.Back to article page