Sciweavers

Share
EVOW
2005
Springer

Ant Algorithm for the Graph Matching Problem

10 years 8 months ago
Ant Algorithm for the Graph Matching Problem
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.
Olfa Sammoud, Christine Solnon, Khaled Ghéd
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where EVOW
Authors Olfa Sammoud, Christine Solnon, Khaled Ghédira
Comments (0)
books