Why it matters
Max clique is classic NP-hard. Understanding shapes optimization approach.
Advertisement
The architecture
Bron-Kerbosch: recursive enumeration.
Pivot for efficiency.
Special classes polynomial.
Advertisement
How it works end to end
BK: R, P, X sets. Recurse per vertex in P.
Pivot: vertex with most neighbors in P.
Perfect graphs: polynomial.