Electronic Resource
Springer
International journal of parallel programming
2 (1973), S. 257-268
ISSN:
1573-7640
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00985661
|
Location |
Call Number |
Expected |
Availability |