Ant algorithm for the graph matching problem

Lecture Notes in Computer Science

Volumn 3448, Issue , 2005, Pages 213-223

  Sammoud, Olfa ^a   Solnon, Christine ^b   Ghédira, Khaled ^a  

^a UNIVERSITY OF TUNIS   (Tunisia)

^b UNIVERSITÉ LYON 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; OPTIMIZATION;

ANT COLONY OPTIMIZATION (ACO); GRAPH MATCHING PROBLEMS; MULTI-LABELED GRAPH; SUBGRAPH ISOMORPHISM PROBLEM;

PROBLEM SOLVING;

EID: 24644481055     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31996-2_20     Document Type: Conference Paper

References (16)

1. A. Aamodt and E. Plaza. Case-Based Reasoning: Foundational Issues, Methodological Variations, and System Approaches. AI Communications, IOS Press, Amsterdam (NL), 7(1):39-59, 1994.
2. R. Ambauen, S. Fischer, and H. Bunke. Graph Edit Distance with Node Splitting and Merging, and Its Application to Diatom Identification. IAPR-TC15 Wksp on Graph-based Representation in Pattern Recognition, LNCS, Springer Verlag, 95-106, 2003.
3. R. Battiti and M. Protasi. Reactive Local Search for the Maximum Clique Problem. Algorithmica, Springer-Verlag, (29), 610-637, 2001.
4. M. Boeres, C. Ribeiro, and I. Bloch. A Randomized Heuristic for Scene Recognition by Graph Matching. WEA 2004, 100-113, 2004.
5. H. Bunke. Error-tolerant Graph Matching: A Formal Framework and Algorithms. Lecture Notes in Computer Science. Springer, Berlin, 1998.
6. H. Bunke and B.T. Messmer. Recent advances in graph matching. International Journal of Pattern Recognition and Artificial Intelligence, (11):169-203, 1997.
7. H. Bunke and K. Shearer. A graph distance metric based on maximal common subgraph. Pattern recognition letters, (19):255-259, 1998.
8. H. Bunke and X. Jiang. Graph matching and similarity. Volume Teodorescu, H-N, Mlynek, D. Kandel, A. Zimmermann, H-J. (ds.): Intelligent Systems and Interfaces, chapter 1, 2000.
9. P. Champin and C. Solnon. Measuring the similarity of labeled graphs. 5th International Conference on Case-Based Reasoning (ICCBR). Lecture Notes in Computer Science - Springer Verlag, 2003.
10. D. Conte, P. Foggia, C. Sansone, and M. Vento. Thirty years of graph matching in pattern recognition. International Journal of Pattern Recognition and Artificial Intelligence, 18(3):265-298, 2004.
11. M. Dorigo and G. Di Caro. The Ant Colony Optimization Meta-heuristic. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization. McGraw Hill, London, UK, pages 11-32, 1999.
12. M. Dorigo and L. Gambardella. Ant Colony System: A cooperative learning approach to traveling salesman problem. IEEE transactions on evolutionary computation, 1(1):53-66, 1997.
13. P. Foggia, C. Sansone, and M. Vento. A database of graphs for isomorphism and sub-graph isomorphism benchmarking. In 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern recognition, pages 176-187, 2001.
14. V. Maniezzo and A.Colorni. The Ant System Applied to the Quadratic Assignement Problem. IEEE Transactions on Data and Knowledge Engineering, 11(5):769-778, 1999.
15. T. Stützle and H.H. Hoos. MAX - MIN Ant System. Journal of Future Generation Computer Systems, 16:889-914, 2000.
16. S. Sorlin and C. Solnon. Reactive Tabu Search for Measuring Graph Similarity, to appear in 5th IAPR Workshop on Graph-based Representations in Pattern Recognition (GbR 2005), LNCS, Springer Verlag, 2005.