A clique-detection algorithm based on neighborhoods in graphs

The notion of cliques is the logical starting point for a broad class of clustering problems. Algorithms for the identification of the cliques of a graph are of great importance in automatic classification by computer. This paper presents an approach which proceeds recursively from the given graph downward through a chain of subgraphs. The proposed approach permits the removal of more than a single point in the progression from one subgraph to the next, thus reducing the number of iterations required for completion.