Algorithm 457: Finding All Cliques of an Undirected Graph [H]

Communications of the ACM

Volumn 16, Issue 9, 1973, Pages 575-577

  Bron, Coen ^a   Kerbosch, Joep ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

backtracking algorithm; branch and bound technique; cliques; clusters; maximal complete subgraphs; recursion

Indexed keywords

EID: 84976668743     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/362342.362367     Document Type: Article

References (6)

1. Augustson, J.G., and Minker, J. An analysis of some graph theoretical cluster techniques, J. ACM 17 (1970), 571-588.
2. Bron, C., Kerbosch, J.A.G.M., and Schell, H.J. Finding cliques in an undirected graph. Tech. Rep. Technological U. of Eindhoven, The Netherlands.
3. Little, John D.C., et al. An algorithm for the traveling salesman problem. Oper. Res. 11 (1963), 972-989.
4. Moon, J.W., and Moser, L. On cliques in graphs. Israel J. Math. 3 (1965), 23-28.
5. Mulligan, G.D., and Cornell, D.G. Corrections to Bier-stone’s algorithm for generating cliques. J. ACM 19 (Apr. 1972), 244-247.
6. Shen, Mok-Kong. Algorithm 202, generation of permutations in lexicographical order. Comm. ACM 6 (Sept. 1963), 517.