A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems - Archive ouverte HAL Access content directly
Conference Papers Year : 2006

A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems

Abstract

Many applications involve matching two graphs in order to identify their common features and compute their similarity. Different kinds of graph matchings, giving rise to different graph similarity measures, have been proposed. In particular [CS03] proposed a multi-labeled graph similarity measure based on a multivalent matching of the graph vertices and [SS05] showed that it is generic in the sense that other well known graph similarity measures can be viewed as special cases of it. In this paper, we address the problem of computing this graph similarity measure. We propose and compare two different kinds of algorithms: an Ant Colony Optimization based algorithm and a Reactive Search. We compare the efficiency of these two algorithms on two different kinds of difficult graph matching problems and we show that they obtain complementary results.
Fichier principal
Vignette du fichier
evocop2006.pdf (202.44 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

Olfa Sammoud, Sébastien Sorlin, Christine Solnon, Khaled Ghedira. A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems. 6th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP 2006), Apr 2006, Budapest, Hungary. pp.287-301, ⟨10.1007/11730095_20⟩. ⟨hal-01541557⟩
229 View
151 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More