Ant Algorithm for the Graph Matching Problem

1. 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)

   Google Scholar 

2. 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)

   Chapter  Google Scholar 

3. Battiti, R., Protasi, M.: Reactive Local Search for the Maximum Clique Problem. Algorithmica 29, 610–637 (2001)

   Article  MATH  MathSciNet  Google Scholar 

4. 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)

   Chapter  Google Scholar 

5. Bunke, H.: Error-tolerant Graph Matching: A Formal Framework and Algorithms. LNCS. Springer, Berlin (1998)

   Google Scholar 

6. Bunke, H., Messmer, B.T.: Recent advances in graph matching. International Journal of Pattern Recognition and Artificial Intelligence 11, 169–203 (1997)

   Article  Google Scholar 

7. Bunke, H., Shearer, K.: A graph distance metric based on maximal common subgraph. Pattern recognition letters 19, 255–259 (1998)

   Article  MATH  Google Scholar 

8. 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)

   Google Scholar 

9. 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)

   Chapter  Google Scholar 

10. 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)

    Article  Google Scholar 

11. 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)

    Google Scholar 

12. 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)

    Article  Google Scholar 

13. 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)

    Google Scholar 

14. 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)

    Article  Google Scholar 

15. Stützle, T., Hoos, H.H.: \(\cal{MAX-MIN}\) Ant System. Journal of Future Generation Computer Systems 16, 889–914 (2000)

    Article  Google Scholar 

16. 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)

    Google Scholar 

Download references