A direct algorithm to find a largest common connected induced subgraph of two graphs

Authors:
Bertrand Cuissart;Jean-Jacques Hébrard
Affiliations:
Groupe de Recherche en Électronique, Informatique et Imagerie de Caen, CNRS-UMR6072, Université de Caen, France;Groupe de Recherche en Électronique, Informatique et Imagerie de Caen, CNRS-UMR6072, Université de Caen, France
Venue:
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Year:
2005

Citing 8
Cited 1

An Algorithm for Subgraph Isomorphism

Journal of the ACM (JACM)
Enumerating all connected maximal common subgraphs in two graphs

Theoretical Computer Science
Introduction to algorithms

Introduction to algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Detection of Distant Structural Similarities in a Set of Proteins Using a Fast Graph-Based Method

Proceedings of the 5th International Conference on Intelligent Systems for Molecular Biology
A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs

Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
A large database of graphs and its use for benchmarking graph isomorphism algorithms

Pattern Recognition Letters - Special issue: Graph-based representations in pattern recognition
A comparison of three maximum common subgraph algorithms on a large database of labeled graphs

GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition

Subquery plan reuse based query optimization

Proceedings of the 17th International Conference on Management of Data

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a direct algorithm that computes a largest common connected induced subgraph of two given graphs. It is based on an efficient generation of the common connected induced subgraphs of the input graphs. Experimental results are provided.