A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs

Authors:
Horst Bunke;Pasquale Foggia;C. Guidobaldi;Carlo Sansone;Mario Vento
Affiliations:
-;-;-;-;-
Venue:
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Year:
2002

Citing 6
Cited 19

Principles of artificial intelligence

Principles of artificial intelligence
A graph distance metric based on the maximal common subgraph

Pattern Recognition Letters
An Algorithm for Subgraph Isomorphism

Journal of the ACM (JACM)
On the minimum common supergraph of two graphs

Computing
Algorithm 457: finding all cliques of an undirected graph

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

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

Common subgraph isomorphism detection by backtracking search

Software—Practice & Experience
High Level - Application Analysis Techniques & Architectures - To Explore Design possibilities for Reduced Reconfiguration Area Overheads in FPGAs executing Compute Intensive Applications

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04
Scenario based dynamic video abstractions using graph matching

Proceedings of the 13th annual ACM international conference on Multimedia
Clone detection in automotive model-based development

Proceedings of the 30th international conference on Software engineering
Median graph: A new exact algorithm using a distance based on the maximum common subgraph

Pattern Recognition Letters
Median graphs: A genetic approach based on new theoretical properties

Pattern Recognition
Learning of graph-based question answering rules

TextGraphs-1 Proceedings of the First Workshop on Graph Based Methods for Natural Language Processing
Graph clustering using the weighted minimum common supergraph

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

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Connected substructure similarity search

Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
An Automated Flow for Arithmetic Component Generation in Field-Programmable Gate Arrays

ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Online structural graph clustering using frequent subgraph mining

ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part III
Index-based model clone detection

Proceedings of the 5th International Workshop on Software Clones
A new approach and faster exact methods for the maximum common subgraph problem

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
A direct algorithm to find a largest common connected induced subgraph of two graphs

GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Efficient subgraph similarity all-matching

DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
An efficient genetic algorithm for subgraph isomorphism

Proceedings of the 14th annual conference on Genetic and evolutionary computation
A graph distance based metric for data oriented workflow retrieval with variable time constraints

Expert Systems with Applications: An International Journal
Maximum common induced subgraph parameterized by vertex cover

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

A graph g is called a maximum common subgraph of two graphs, g1 and g2, if there exists no other common subgraph of g1 and g2 that has more nodes than g. For the maximum common subgraph problem, exact and inexact algorithms are known from the literature. Nevertheless, until now no effort has been done for characterizing their performance. In this paper, two exact algorithms for maximum common subgraph detection are described. Moreover a database containing randomly connected pairs of graphs, having a maximum common graph of at least two nodes, is presented, and the performance of the two algorithms is evaluated on this database.