Concepedia

Algorithm 457: finding all cliques of an undirected graph

Coen Bron, Joep Kerbosch

Communications of the ACM · 1973 · 2.5K citations · 6 references

DOIFull text

Open access

Concepts

Abstract

bttroductian. A maximal complete subgraph (clique) is a complete subgraph that is not contained in any other complete subgraph.

References

6

An Algorithm for the Traveling Salesman Problem

John D. C. Little, Katta G. Murty, Dura W. Sweeney et al. · Operations Research · 1963 · 1K citations · Full text

, , +14

On cliques in graphs

J. W. Moon, Leo Moser · Israel Journal of Mathematics · 1965 · 854 citations

, , +4

An Analysis of Some Graph Theoretical Cluster Techniques

J. Gary Augustson, Jack Minker · Journal of the ACM · 1970 · 229 citations · Full text

, , +16

Corrections to Bierstone's Algorithm for Generating Cliques

Gordon D. Mulligan, Derek G. Corneil · Journal of the ACM · 1972 · 73 citations · Full text

, , +7

Finding cliques in an undirected graph

Coen Bron, Jagm Kerbosch, HJ Henk Schell · TU/e Research Portal (Eindhoven University of Technology) · 1972 · 16 citations · Full text

, , +7