International Journal of Computer & Information Sciences

, Volume 2, Issue 4, pp 257–268

A clique-detection algorithm based on neighborhoods in graphs


  • Robert E. Osteen
    • Center for Informatics ResearchUniversity of Florida
  • Julius T. Tou
    • Center for Informatics ResearchUniversity of Florida

DOI: 10.1007/BF00985661

Cite this article as:
Osteen, R.E. & Tou, J.T. International Journal of Computer and Information Sciences (1973) 2: 257. doi:10.1007/BF00985661


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.

Download to read the full article text

Copyright information

© Plenum Publishing Corporation 1973