Search for maximal cliques in a graph.
This algorithm searches for maximal cliques in a graph. maximal cliques are the largest complete subgraph containing a given point. The largest maximal clique is sometimes called the maximum clique.
This algorithm produces the list of maximal cliques each of which are a list of the members of the clique.
Based on Algol algorithm published by Bron & Kerbosch A C version is available as part of the rambin package. http://www.ram.org/computing/rambin/rambin.html
Reference:
@article{362367,
author = {Coen Bron and Joep Kerbosch},
title = {Algorithm 457: finding all cliques of an undirected graph},
journal = {Commun. ACM},
volume = {16},
number = {9},
year = {1973},
issn = {0001-0782},
pages = {575--577},
doi = {http://doi.acm.org/10.1145/362342.362367},
publisher = {ACM Press},
}