Reporting maximal cliques: new insights into an old problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2006

Reporting maximal cliques: new insights into an old problem

Frédéric Cazals
  • Function : Author
  • PersonId : 905122


Reporting maximal cliques of a graph is a fundamental problem arising many areas. Surprisingly, this problem is often tackled resorting to the old Bron-Kerbosch algorithm (1973), or its recent variant by I. Koch (2001). Both algorithms suffer from a poor output sensitivity and worst-cases. In this context, this paper makes three contributions. First, we show that a slight modification of the greedy pivoting strategy used by I. Koch allows one to get rid of worst-cases, also improving overall performances. Second, exploiting the recursive structure of non maximal cliques, we show the pivoting strategy developed by I. Koch is a particular case of a more general optimization strategy based on the concept of {\em dominated} nodes. Using different instantiations of this concept, we design four modified Bron-Kerbosch algorithms, with better output-sensitivity. Third, we discuss implementation issues and provide a detailed experimental study on random graphs. The bottom-line of this study is the investigation of the trade-off between output sensitivity and the overhead associated to the identification of dominated nodes.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-5615.pdf (237.82 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00070393 , version 1 (19-05-2006)
inria-00070393 , version 2 (30-01-2007)


  • HAL Id : inria-00070393 , version 2


Frédéric Cazals, Chinmay Karande. Reporting maximal cliques: new insights into an old problem. [Research Report] RR-5615, INRIA. 2006, pp.25. ⟨inria-00070393v2⟩
124 View
1057 Download


Gmail Facebook Twitter LinkedIn More