Skip to main content
SpringerLink
Log in
Book cover

European Conference on Evolutionary Computation in Combinatorial Optimization

EvoCOP 2006: Evolutionary Computation in Combinatorial Optimization pp 234–246Cite as

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

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3906))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akutsu, T.: Protein structure alignment using a graph matching technique. Technical report, Bioinformatics Center, Institute for Chemical Research, Kyoto University. Uji, Kyoto 611-0011, Japan (1995)

    Google Scholar 

  2. Alaya, I., Solnon, C., Ghédira, K.: Ant algorithm for the multi-dimensional knapsack problem. In: International Conference on Bioinspired Optimization Methods and their Applications (BIOMA 2004), pp. 63–72 (2004)

    Google Scholar 

  3. Ambauen, R., Fischer, S., Bunke, H.: Graph edit distance with node splitting and merging and its application to diatom identification. In: Hancock, E.R., Vento, M. (eds.) GbRPR 2003. LNCS, vol. 2726, pp. 95–106. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Battiti, R., Protasi, M.: Reactive local search for the maximum clique problem. Algorithmica 29, 610–637 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  5. 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 

  6. Bunke, H.: On a relation between graph edit distance and maximum common subgraph. PRL: Pattern Recognition Letters 18, 689–694 (1997)

    Article  Google Scholar 

  7. 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, Kluwer Academic Publishers, Dordrecht (2000)

    Google Scholar 

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

    Article  MATH  Google Scholar 

  9. Burke, E.K., MacCarthy, B.L., Petrovic, S., Qu, R.: Case-based reasoning in course timetabling: An attribute graph approach. In: Aha, D.W., Watson, I. (eds.) ICCBR 2001. LNCS, vol. 2080, pp. 90–104. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Champin, P.-A., Solnon, C.: Measuring the similarity of labeled graphs. In: Ashley, K.D., Bridge, D.G. (eds.) ICCBR 2003. LNCS, vol. 2689, pp. 80–95. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Conte, D., Foggia, P., Sansone, C., Vento, M.: 30 years of graph matching in pattern recognition. Int. Jour. of Pattern Recogn. and AI 18(3), 265–298 (2004)

    Article  Google Scholar 

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

  13. Dorigo, M., Stützle, T.: Ant colony optimization. MIT Press, Cambridge (2004)

    MATH  Google Scholar 

  14. Glover, F.: Tabu search - part I. Journal on Computing, 190–260 (1989)

    Google Scholar 

  15. Kirkpatrick, S., Gelatt, S., Vecchi, M.: Optimisation by simulated annealing. Science 220, 671–680 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  16. Messmer, B.T., Bunke, H.: Efficient subgraph isomorphism detection: a decomposition approach. IEEE Trans. on Knowledge and Data Engineering 12(2), 307–323 (2000)

    Article  Google Scholar 

  17. Petrovic, S., Kendall, G., Yang, Y.: A tabu search approach for graph-structured case retrieval. In: Proc. of the STarting Artificial Intelligence Researchers Symposium (STAIRS 2002), pp. 55–64. IOS Press, Amsterdam (2002)

    Google Scholar 

  18. Sammoud, O., Solnon, C., Ghédira, K.: Ant algorithm for the graph matching problem. In: Raidl, G.R., Gottlieb, J. (eds.) EvoCOP 2005. LNCS, vol. 3448, pp. 213–223. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  19. Solnon, C., Fenet, S.: A study of aco capabilities for solving the maximum clique problem. Journal of Heuristics- Springer (to appear, 2006)

    Google Scholar 

  20. Sorlin, S., Solnon, C.: Reactive tabu search for measuring graph similarity. In: Brun, L., Vento, M. (eds.) GbRPR 2005. LNCS, vol. 3434, pp. 172–182. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  21. Stützle, T., Hoos, H.H.: Max-min Ant System. Journal of Future Generation Computer Systems 16, 889–914 (2000)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SOIE, Institut Supérieur de Gestion de Tunis, 41 rue de la Liberté, Cité Bouchoucha, 2000, Le Bardo, Tunisia

    Olfa Sammoud & Khaled Ghédira

  2. LIRIS, CNRS UMR 5205, bât. Nautibus, University of Lyon I, 43 Bd du 11 novembre, 69622 cedex, Villeurbanne, France

    Olfa Sammoud, Sébastien Sorlin & Christine Solnon

Authors
  1. Olfa Sammoud
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sébastien Sorlin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christine Solnon
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Khaled Ghédira
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. SAP AG, Neurottstr. 16, 69190, Walldorf, Germany

    Jens Gottlieb

  2. Institute of Computer Graphics and Algorithms, Vienna University of Technology, Favoritenstraße 9–11/1861, 1040, Vienna, Austria

    Günther R. Raidl

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sammoud, O., Sorlin, S., Solnon, C., Ghédira, K. (2006). A Comparative Study of Ant Colony Optimization and Reactive Search for Graph Matching Problems. In: Gottlieb, J., Raidl, G.R. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2006. Lecture Notes in Computer Science, vol 3906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11730095_20

Download citation

  • DOI: https://doi.org/10.1007/11730095_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33178-0

  • Online ISBN: 978-3-540-33179-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation