Bron-Kerbosch 演算法是一種用於查詢圖中所有極大團的有效方法。
Bron-Kerbosch 演算法
參見
團, 極大團使用 探索
參考文獻
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 演算法。" 來自 Web 資源。 https://mathworld.tw/Bron-KerboschAlgorithm.html