Determining Cliques of a Graph
Loading...
Files
Date
1975
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
A generalization of the neighborhood of a vertex [7] is used to prove several results on the relation of a set of vertices of a graph to cliques of that graph. These results lead to an efficient adaptive algorithm for enumerating the cliques of a graph. The storage requirement of the algorithm is of order O(n2).