A comparative study of ant colony optimization and reactive search for graph matching problems

Authors:
Olfa Sammoud;Sébastien Sorlin;Christine Solnon;Khaled Ghédira
Affiliations:
SOIE, Institut Supérieur de Gestion de Tunis, Le Bardo, Tunis;LIRIS, CNRS UMR 5205, bât. Nautibus, University of Lyon I, Villeurbanne, France;LIRIS, CNRS UMR 5205, bât. Nautibus, University of Lyon I, Villeurbanne, France;SOIE, Institut Supérieur de Gestion de Tunis, Le Bardo, Tunis
Venue:
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Year:
2006

Citing 13
Cited 3

On a relation between graph edit distance and maximum common subgraph

Pattern Recognition Letters
A graph distance metric based on the maximal common subgraph

Pattern Recognition Letters
The ant colony optimization meta-heuristic

New ideas in optimization
Graph matching and similarity

Intelligent systems and interfaces
MAX-MIN Ant system

Future Generation Computer Systems
Efficient Subgraph Isomorphism Detection: A Decomposition Approach

IEEE Transactions on Knowledge and Data Engineering
Case-Based Reasoning in Course Timetabling: An Attribute Graph Approach

ICCBR '01 Proceedings of the 4th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
Ant Colony Optimization

Ant Colony Optimization
A study of ACO capabilities for solving the maximum clique problem

Journal of Heuristics
Graph edit distance with node splitting and merging, and its application to diatom identification

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

ICCBR'03 Proceedings of the 5th international conference on Case-based reasoning: Research and Development
Ant algorithm for the graph matching problem

EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
Reactive tabu search for measuring graph similarity

GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition

ARG Based on Arcs and Segments to Improve the Symbol Recognition by Genetic Algorithm

Graphics Recognition. Recent Advances and New Opportunities
Inexact graph matching based on kernels for object retrieval in image databases

Image and Vision Computing
Using local similarity measures to efficiently address approximate graph matching

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many applications involve matching two graphs in order to identify their common features and compute their similarity. In this paper, we address the problem of computing a graph similarity measure based on a multivalent graph matching and which is generic in the sense that other well known graph similarity measures can be viewed as special cases of it. We propose and compare two different kinds of algorithms: an Ant Colony Optimization based algorithm and a Reactive Search. We compare the efficiency of these two algorithms on two different kinds of difficult graph matching problems and we show that they obtain complementary results.