Ant Algorithm for the Graph Matching Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

Ant Algorithm for the Graph Matching Problem

Résumé

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.
Fichier principal
Vignette du fichier
ANT-GM_pub.pdf (184.35 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01541554 , version 1 (24-03-2020)

Identifiants

Citer

Olfa Sammoud, Christine Solnon, Khaled Ghedira. Ant Algorithm for the Graph Matching Problem. 5th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2005), Mar 2005, Lausanne, Switzerland. pp.213-223, ⟨10.1007/978-3-540-31996-2_20⟩. ⟨hal-01541554⟩
102 Consultations
187 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More