Bron-Kerbosch 算法是一种用于查找图中所有极大团的有效方法。
Bron-Kerbosch 算法
参见
团, 极大团使用 Wolfram|Alpha 探索
参考文献
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.请引用为
Weisstein, Eric W. "Bron-Kerbosch 算法。" 来自 MathWorld--Wolfram Web 资源。 https://mathworld.net.cn/Bron-KerboschAlgorithm.html