The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.
Bron-Kerbosch Algorithm
See also
Clique, Maximal CliqueExplore with Wolfram|Alpha
References
Akkoyunlu, E. A. "The Enumeration of Maximal Cliques of Large Graphs." SIAM J. Comput. 2, 1-6, 1973.Bron, C. and Kerbosch, J. "Algorithm 457: Finding All Cliques of an Undirected Graph." Comm. ACM 16, 48-50, 1973.Tomita, E.; Tanaka, A.; and Takahashi, H. "The Worst-Case Time Complexity for Generating All Maximal Cliques and Computational Experiments." Theor. Comput. Sci. 363, 28-42, 2006.Cite this as:
Weisstein, Eric W. "Bron-Kerbosch Algorithm." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/Bron-KerboschAlgorithm.html