An algorithm for reporting maximal c-cliques

Authors:
F. Cazals;C. Karande
Affiliations:
INRIA Sophia-Antipolis, France;IIT Bombay, India
Venue:
Theoretical Computer Science
Year:
2005

Citing 2
Cited 6

Molecular docking using shape descriptors

Journal of Computational Chemistry
Enumerating all connected maximal common subgraphs in two graphs

Theoretical Computer Science

Note: A note on the problem of reporting maximal cliques

Theoretical Computer Science
Large human communication networks: patterns and a utility-driven generator

Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Irregular Community Discovery for Social CRM in Cloud Computing

CloudCom '09 Proceedings of the 1st International Conference on Cloud Computing
Discovery of protein's multifunction and diversity of information transmission

ICIC'10 Proceedings of the 6th international conference on Advanced intelligent computing theories and applications: intelligent computing
Assignment-minimum clique coverings

Journal of Experimental Algorithmics (JEA)
Irregular community discovery for cloud service improvement

The Journal of Supercomputing

Quantified Score

Hi-index	5.23

Visualization

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 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.