Chapter 6. Graph Edit Distance – Optimal and Suboptimal Algorithms with Applications

  1. PD Dr. habil. Matthias Dehmer2,3,
  2. Prof. Dr. Frank Emmert-Streib4
  1. Horst Bunke,
  2. Kaspar Riesen

Published Online: 21 AUG 2009

DOI: 10.1002/9783527627981.ch6

Book Title

Analysis of Complex Networks: From Biology to Linguistics

Analysis of Complex Networks: From Biology to Linguistics

Additional Information

How to Cite

Bunke, H. and Riesen, K. (2009) Graph Edit Distance – Optimal and Suboptimal Algorithms with Applications, in Analysis of Complex Networks: From Biology to Linguistics (eds M. Dehmer and F. Emmert-Streib), Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim, Germany. doi: 10.1002/9783527627981.ch6

Editor Information

  1. 2

    Vienna University of Technology, Discrete Mathematics and Geometry, Wiedner Hauptstraße 8–10, 1040 Vienna, Austria

  2. 3

    University of Coimbra, Center for Mathematics, Apartado 3008, 3001-454 Coimbra, Portugal

  3. 4

    Computational Biology and Machine Learning, Center for Cancer Research and Cell Biology, School of Medicine, Dentistry and Biomedical Sciences, Queen's University Belfast, 97 Lisburn Road, Belfast, BT9 7BL, UK

Author Information

  1. University of Bern, Institute of Computer Science and Applied Mathematics, Neubrückstraße 10, 3012 Bern, Switzerland

Publication History

  1. Published Online: 21 AUG 2009
  2. Published Print: 22 APR 2009

ISBN Information

Print ISBN: 9783527323456

Online ISBN: 9783527627981

SEARCH

CHAPTER TOOLS

Get PDF (374K)

Keywords:

  • graph edit distance (GED);
  • algorithms;
  • computation of GED;
  • experimental evaluation

Summary

This chapter contains sections titled:

  • Introduction

  • Graph Edit Distance

  • Computation of GED

  • Applications

  • Experimental Evaluation

  • Summary and Conclusions

  • References

Get PDF (374K)