Additional Key Words and Phrases: clustering technique, clique, maximal complete subgraph, algorith, graph
Selected papers that cite this one
- E. A. Akkoyunlu. The enumeration of maximal cliques of large graphs. SIAM Journal on Computing, 2(1):1-6, March 1973.
- Robert M. Haralick. The diclique representation and decomposition of binary relations. Journal of the ACM, 21(3):356-366, July 1974.
- Chung C. Wang. An algorithm for the chromatic number of a graph. Journal of the ACM, 21(3):385-391, July 1974.
Selected references
- J. Gary Augustson and Jack Minker. An analysis of some graph theoretical cluster techniques. Journal of the ACM, 17(4):571-588, October 1970.