Bron-Kerbosch
Recursive: enumerates all maximal cliques. Complement graph: cliques ↔ independent sets.
Advertisement
Pivoting
Choose pivot vertex; only branch on non-neighbors. Cuts search tree dramatically.
Advertisement
Complexity
O(3^(V/3)) worst case. Practical: handles graphs with 100s of vertices.
Bipartite case
Polynomial: V - min vertex cover = V - max matching (König). Use max matching.