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.
Domaines
Informatique [cs]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...