An algorithm for reporting maximal c-cliques - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2006

An algorithm for reporting maximal c-cliques

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


Given two graphs, a fundamental task faced by matching algorithms consists of computing either the (Connected) Maximal Common Induced Subgraphs ((C)MCIS) or the (Connected) Maximal Common Edge Subgraphs ((C)MCES). In particular, computing the CMCIS or CMCES reduces to reporting so-called connected cliques in product graphs, a problem for which an algorithm has been presented in a recent paper I. Koch, TCS 250 (1-2), 2001. This algorithm suffers from two problems which are corrected in this note.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-5642.pdf (116.29 Ko) Télécharger le fichier

Dates and versions

inria-00070365 , version 1 (19-05-2006)


  • HAL Id : inria-00070365 , version 1


Frédéric Cazals, Chinmay Karande. An algorithm for reporting maximal c-cliques. [Research Report] RR-5642, INRIA. 2006, pp.10. ⟨inria-00070365⟩
67 View
228 Download


Gmail Facebook Twitter LinkedIn More