BronāKerbosch algorithm is an enumeration algorithm for finding maximal cliques in an undirected graph. Any n-vertex graph has at most 3^nā3 maximal cliques, and the worst-case running time of the BronāKerbosch algorithm (with a pivot strategy) is O(3^nā3).
