Ant algorithm for the graph matching problem

Authors:
Olfa Sammoud;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;SOIE, Institut Supérieur de Gestion de Tunis, Le Bardo, Tunis
Venue:
EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
Year:
2005

Citing 10
Cited 3

Case-based reasoning: foundational issues, methodological variations, and system approaches

AI Communications
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
The Ant System Applied to the Quadratic Assignment Problem

IEEE Transactions on Knowledge and Data Engineering
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
Reactive tabu search for measuring graph similarity

GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

Constraint-based graph matching

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Isomorphism Testing via Polynomial-Time Graph Extensions

Journal of Mathematical Modelling and Algorithms
A comparative study of ant colony optimization and reactive search for graph matching problems

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a new Ant Colony Optimization (ACO) algorithm for solving Graph Matching Problems, the goal of which is to find the best matching between vertices of multi-labeled graphs. This new ACO algorithm is experimentally compared with greedy and reactive tabu approaches on subgraph isomorphism problems and on multivalent graph matching problems.