A clique-detection algorithm based on neighborhoods in graphs

  • Robert E. Osteen
  • Julius T. Tou
Article

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Plenum Publishing Corporation 1973

Authors and Affiliations

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

Personalised recommendations