A note on the problem of reporting maximal cliques

Reporting the maximal cliques of a graph is a fundamental problem arising in many areas. This note bridges the gap between three papers addressing this problem: the original paper of Bron-Kerbosh (Comm. of the ACM, 1973), and two papers recently published in TCS, namely that of Tomita et al. (TCS 363, 2006), and that of Koch (TCS 250, 2001). In particular, we show that the strategy of Tomita et al. is a simple modification of the Bron-Kerbosch algorithm, based on an (un-exploited) observation raised in Koch's paper.

• Type: Journal
• Year: 2008
• Where: TCS
• Authors: Frédéric Cazals, Chinmay Karande
• Keywords: Fundamental Problem, Maximal Cliques, TCS 2008, Theoretical Computer Science, Tomita Et