A large database of graphs and its use for benchmarking graph isomorphism algorithms

Authors:
M. De Santo;P. Foggia;C. Sansone;M. Vento
Affiliations:
Dipartimento di Ing. dell'Informazione e di Ing. Elettrica, Università di Salerno, Via Ponte Don Melillo, 1 I-84084 Salerno, Italy;Dipartimento di Informatica e Sistemistica, Università di Napoli "Federico II" Via Claudio, 21 I-80125 Napoli, Italy;Dipartimento di Informatica e Sistemistica, Università di Napoli "Federico II" Via Claudio, 21 I-80125 Napoli, Italy;Dipartimento di Ing. dell'Informazione e di Ing. Elettrica, Università di Salerno, Via Ponte Don Melillo, 1 I-84084 Salerno, Italy
Venue:
Pattern Recognition Letters - Special issue: Graph-based representations in pattern recognition
Year:
2003

Citing 9
Cited 10

Using genetic algorithms to solve NP-complete problems

Proceedings of the third international conference on Genetic algorithms
Model matching in robot vision by subgraph isomorphism

Pattern Recognition
An Algorithm for Subgraph Isomorphism

Journal of the ACM (JACM)
A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices

Journal of the ACM (JACM)
Structural Matching in Computer Vision Using Probabilistic Relaxation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Including Geometry in Graph Representations: A Quadratic-Time Graph Isomorphism Algorithm and Its Application

SSPR '96 Proceedings of the 6th International Workshop on Advances in Structural and Syntactical Pattern Recognition
Efficient Attributed Graph Matching and Its Application to Image Analysis

ICIAP '95 Proceedings of the 8th International Conference on Image Analysis and Processing
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Performance Evaluation of the VF Graph Matching Algorithm

ICIAP '99 Proceedings of the 10th International Conference on Image Analysis and Processing

Benchmarking graph-based clustering algorithms

Image and Vision Computing
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
A cytoscape based framework for efficient sub-graph isomorphic protein-protein interaction motif lookup

Proceedings of the 2010 ACM Symposium on Applied Computing
Constraint-based graph matching

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Extracting plane graphs from images

SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Isomorphism Testing via Polynomial-Time Graph Extensions

Journal of Mathematical Modelling and Algorithms
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
SFA: a symbolic fourier approximation and index for similarity search in high dimensional datasets

Proceedings of the 15th International Conference on Extending Database Technology
Finding patterns in an unknown graph

AI Communications - The Symposium on Combinatorial Search
Polynomial algorithms for open plane graph and subgraph isomorphisms

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Despite of the fact that graph-based methods are gaining more and more popularity in different scientific areas, it has to be considered that the choice of an appropriate algorithm for a given application is still the most crucial task.The lack of a large database of graphs makes the task of comparing the performance of different graph matching algorithms difficult, and often the selection of an algorithm is made on the basis of a few experimental results available.In this paper we present an experimental comparative evaluation of the performance of four graph matching algorithms. In order to perform this comparison, we have built and made available a large database of graphs, which is also described in detail in this article.