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 is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. G. Augustson and J. Minker, “An analysis of some graph theoretical cluster techniques,”J. ACM 17(4):571–588 (1970).
A. R. Bednarek and O. E. Taulbee, “On maximal chains,”Rev. Roum. Math. Pures et Appl. XI(1):23–25 (1966).
R. E. Bonner, “On some clustering techniques,”IBM J. Res. Develop. 8(1):22–32 (1964).
C. C. Gotlieb and S. Kumar, “Semantic clustering of index terms,”J. ACM 15(4):493–513 (1968).
F. Harary,Graph Theory (Addison-Wesley, Reading, Mass. 1969).
N. Jardine and R. Sibson, “The construction of hierarchic and non-hierarchic classifications,”Comp. J. 11:177–184 (1968).
J. Moon and L. Moser, “On cliques in graphs,”Israel J. Math. 3 (March):23–28 (1965).
Author information
Authors and Affiliations
Additional information
This work was supported by the Army Research Office—Durham under Grant Number DA-ARO-D-31-124-70-G92.
Rights and permissions
About this article
Cite this article
Osteen, R.E., Tou, J.T. A clique-detection algorithm based on neighborhoods in graphs. International Journal of Computer and Information Sciences 2, 257–268 (1973). https://doi.org/10.1007/BF00985661
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00985661