Sciweavers

Share
EVOW
2006
Springer

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

11 years 2 months ago
A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems
Many applications involve matching two graphs in order to identify their common features and compute their similarity. In this paper, we address the problem of computing a graph similarity measure based on a multivalent graph matching and which is generic in the sense that other well known graph similarity measures can be viewed as special cases of it. 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.
Olfa Sammoud, Sébastien Sorlin, Christine S
Added 22 Aug 2010
Updated 22 Aug 2010
Type Conference
Year 2006
Where EVOW
Authors Olfa Sammoud, Sébastien Sorlin, Christine Solnon, Khaled Ghédira
Comments (0)
books