A clique-detection algorithm based on neighborhoods in graphs

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.

This work was supported by the Army Research Office—Durham under Grant Number DA-ARO-D-31-124-70-G92.