Skip to Main content Skip to Navigation

An algorithm for reporting maximal c-cliques

Frédéric Cazals 1 Chinmay Karande 1
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : 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.
Document type :
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Friday, May 19, 2006 - 8:16:57 PM
Last modification on : Friday, February 4, 2022 - 3:15:23 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:03:02 PM


  • 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⟩



Record views


Files downloads