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.

• Type: Conference
• Year: 2005
• Where: EVOW
• Authors: Olfa Sammoud, Christine Solnon, Khaled Ghédira
• Keywords: Artificial Intelligence, EVOW 2005, Graph Matching Problems, Reactive Tabu Approaches, Subgraph Isomorphism Problems