Record Details

An algorithm for reporting maximal c-cliques

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title An algorithm for reporting maximal c-cliques
 
Creator CAZALS, F
KARANDE, C
 
Subject graphs
maximal c-connected cliques
maximal-cliques
maximal common induced/edge subgraphs
shape matching
 
Description 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 c-connected cliques in product graphs, a problem for which an algorithm has been presented in I. Koch, Fundamental study: enumerating all connected maximal common subgraphs in two graphs, Theoret. Comput. Sci. 250 (1-2), (2001) 1-30. This algorithm suffers from two problems which are corrected in this note. (c) 2005
 
Publisher ELSEVIER SCIENCE BV
 
Date 2011-07-24T08:39:47Z
2011-12-26T12:47:55Z
2011-12-27T05:42:04Z
2011-07-24T08:39:47Z
2011-12-26T12:47:55Z
2011-12-27T05:42:04Z
2005
 
Type Article
 
Identifier THEORETICAL COMPUTER SCIENCE, 349(3), 484-490
0304-3975
http://dx.doi.org/10.1016/j.tcs.2005.09.038
http://dspace.library.iitb.ac.in/xmlui/handle/10054/6371
http://hdl.handle.net/10054/6371
 
Language en