Cliques of a graph-variations on the Bron-Kerbosch algorithm

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

This paper develops a family of algorithms that are variations on the Bron-Kerbosch algorithm for finding all the cliques of a simple undirected graph. The algorithms are developed in a stepwise manner, from a recursive algorithm for generating all combinations of zero or more objects chosen fromN objects. Experimental results are given.

This work was supported in part by National Science Foundation grant DCR 72-03752 AO2.