FINDING ALL CLIQUES OF AN UNDIRECTED GRAPH [H]
FINDING ALL CLIQUES OF AN UNDIRECTED GRAPH [H]
复制标题
DOI：
10.1145/362342.362367
复制
发表时间：
1973-01-01
影响因子：
22.7
通讯作者：
KERBOSCH, J
中科院分区：
文献类型：
--
作者：
BRON, C;KERBOSCH, J
第一个版本是基本算法的直接实现。它主要是为了说明所使用的方法。这个版本按字母顺序（词典顺序）生成集团。第二个版本是从第一个版本派生而来的，它以一种相当不可预测的顺序生成团，试图最小化要遍历的分支数量。这个版本倾向于首先产生较大的集团，然后依次产生具有较大公共交集的集团。这里给出了版本2的详细算法。
The first version is a straightforward implementation of the basic algorithm. It is mainly presented to illustrate the method used. This version generates cliques in alphabetic (lexicographic) order. The second version is derived from the first and generates cliques in a rather unpredictable order in an attempt to minimize the number of branches to be traversed. This version tends to produce the larger cliques first and to generate sequentially cliques having a large common intersection. The detailed algorithm for version 2 is presented here.