Bron-Kerbosch Algorithm

The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.

Explore with Wolfram|Alpha

More things to try:

asymptotes (2x^3 + 4x^2 - 9)/(3 - x^2)
Gamma(z)*Gamma(1-z)
minimal polynomial sqrt(2)+sqrt(3)

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

Bron-Kerbosch Algorithm

See also

Explore with Wolfram|Alpha

References

Cite this as:

Subject classifications