Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aamodt, A., Plaza, E.: Case-Based Reasoning: Foundational Issues, Methodological Variations, and System Approaches. In: AI Communications, vol. 7(1), pp. 39–59. IOS Press, Amsterdam (1994)
Ambauen, R., Fischer, S., Bunke, H.: Graph Edit Distance with Node Splitting and Merging, and Its Application to Diatom Identification. In: IAPR-TC15 Wksp on Graph-based Representation in Pattern Recognition. LNCS, pp. 95–106. Springer, Heidelberg (2003)
Battiti, R., Protasi, M.: Reactive Local Search for the Maximum Clique Problem. Algorithmica 29, 610–637 (2001)
Boeres, M., Ribeiro, C., Bloch, I.: A Randomized Heuristic for Scene Recognition by Graph Matching. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol. 3059, pp. 100–113. Springer, Heidelberg (2004)
Bunke, H.: Error-tolerant Graph Matching: A Formal Framework and Algorithms. LNCS. Springer, Berlin (1998)
Bunke, H., Messmer, B.T.: Recent advances in graph matching. International Journal of Pattern Recognition and Artificial Intelligence 11, 169–203 (1997)
Bunke, H., Shearer, K.: A graph distance metric based on maximal common subgraph. Pattern recognition letters 19, 255–259 (1998)
Bunke, H., Jiang, X.: Graph matching and similarity. In: Teodorescu, H.-N., Mlynek, D., Kandel, A., Zimmermann, H.-J. (eds.) Intelligent Systems and Interfaces, ch. 1 (2000)
Champin, P., Solnon, C.: Measuring the similarity of labeled graphs. In: Ashley, K.D., Bridge, D.G. (eds.) ICCBR 2003. LNCS, vol. 2689, Springer, Heidelberg (2003)
Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. International Journal of Pattern Recognition and Artificial Intelligence 18(3), 265–298 (2004)
Dorigo, M., Di Caro, G.: The Ant Colony Optimization Meta-heuristic. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 11–32. McGraw Hill, London (1999)
Dorigo, M., Gambardella, L.: Ant Colony System: A cooperative learning approach to traveling salesman problem. IEEE transactions on evolutionary computation 1(1), 53–66 (1997)
Foggia, P., Sansone, C., Vento, M.: A database of graphs for isomorphism and sub-graph isomorphism benchmarking. In: 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern recognition, pp. 176–187 (2001)
Maniezzo, V., Colorni, A.: The Ant System Applied to the Quadratic Assignement Problem. IEEE Transactions on Data and Knowledge Engineering 11(5), 769–778 (1999)
Stützle, T., Hoos, H.H.: \(\cal{MAX-MIN}\) Ant System. Journal of Future Generation Computer Systems 16, 889–914 (2000)
Sorlin, S., Solnon, C.: Reactive Tabu Search for Measuring Graph Similarity. In: To appear in 5th IAPR Workshop on Graph-based Representations in Pattern Recognition (GbR 2005). LNCS, Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sammoud, O., Solnon, C., Ghédira, K. (2005). Ant Algorithm for the Graph Matching Problem. In: Raidl, G.R., Gottlieb, J. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2005. Lecture Notes in Computer Science, vol 3448. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31996-2_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-31996-2_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25337-2
Online ISBN: 978-3-540-31996-2
eBook Packages: Computer ScienceComputer Science (R0)