A similarity measure for graphs with low computational complexity

Applied Mathematics and Computation

Volumn 182, Issue 1, 2006, Pages 447-459

  Dehmer, Matthias ^a   Emmert Streib, Frank ^b   Kilian, Jürgen ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b STOWERS INSTITUTE FOR MEDICAL RESEARCH   (United States)

Author keywords

Computational complexity; Dynamic programming; Graph similarity; Graph theory

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; POLYNOMIALS;

GRAPH CLASS; GRAPH SIMILARITY; OPTIMAL ALIGNMENTS; TIME COMPLEXITY;

GRAPH THEORY;

EID: 33750819438     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2006.04.006     Document Type: Article

References (26)

1. Bang-Jensen J., and Gutin G. Digraphs. Theory, Algorithms and Applications (2000), Springer-Verlag, London-Berlin-Heidelberg
2. Bellman R. Dynamic Programming (1957), Princeton University Press
3. H. Bunke, G. Allermann, A metric on graphs for structural pattern recognition, in: H.W. Schussler (Ed.), SIGNAL PROCESSING II: Theory and Applications, 1983, pp. 257-260.
4. H. Bunke, Graph matching: theoretical foundations, algorithms, and applications, in: Proceedings of the Vision Interface 2000, Montreal/Canada, 2000, pp. 82-88.
5. H. Bunke, Recent developments in graph matching, in: Proceedings of the 15th International Conference on Pattern Recognition, Barcelona/Spain, 2000, vol. 2, pp. 117-124.
6. F. Emmert-Streib, M. Dehmer, J. Kilian, Classification of large graphs by a local tree decomposition, in: H.R. Arabnia, A. Scime (Eds.), Proceedings of the 2005 International Conference on Data Mining (DMIN'05), 2005, pp. 200-207.
7. R. Gleim, A. Mehler, M. Dehmer, Web corpus mining by instance of Wikipedia, Appears in Proceedings of the EACL 2006 Workshop on Web as Corpus, Trento, Italy, 3-7 April 2006.
8. Gusfield D. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology (1997), Cambridge University Press
9. M. Höchstmann, T. Töller, R. Giegerich, S. Kurtz, Local similarity in RNA secondary structures, in: Proceedings of the IEEE Computational Systems Bioinformatics Conference (CSB'03), 2003, pp. 159-168.
10. Jiang T., Wang L., and Zhang K. Alignment of Trees - An Alternative to Tree Edit. Theoretical Computer Science vol. 143 (1995), Elsevier pp. 137-148
11. F. Kaden, Graph metrics and distance-graphs, in: M. Fiedler (Ed.), Graphs and other Combinatorial Topics Teubner Texte zur Math., Leipzig, 1983, vol. 59, pp. 145-158.
12. Kaden F. Graphmetriken und Distanzgraphen. ZKI-Informationen, Akad. Wiss. DDR (1982) 1-63
13. Koch I., Lengauer T., and Wanke E. An algorithm for finding maximal common subtopologies in a set of protein structures. J. Comput. Biol. 3 2 (1996) 289-306
14. Levenstein V.I. Binary codes capable of correcting deletions insertions and reversals. Soviet Phys. Dokl. 10 (1966) 707-710
15. Mehler A. Hierarchical orderings of textual units. Proceedings of the 19th International Conference on Computational Linguistics (COLING 2002), Taipei, Taiwan (2002), Morgan Kaufmann, San Francisco 646-652
16. Mehler A., Dehmer M., and Gleim R. Towards logical hypertext structure. A graph-theoretic perspective. Proceedings of I2CS'04, Guadalajara/Mexico. Lecture Notes in Computer Science (2004), Springer, Berlin-New York
17. Sankoff D., and Kruskal J.B. Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison (1983), Addison-Wesley
18. Sankoff D., Kruskal J.B., Mainville S., and Cedergren R.J. Fast algorithms to determine RNA secondary structures containing multiple loops. In: Sankoff D., and Kruskal J.B. (Eds). Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison (1983), Addison-Wesley 93-120
19. Selkow S.M. The tree-to-tree editing problem. Inform. Process. Lett. 6 6 (1977) 184-186
20. Sobik F. Graphmetriken und klassifikation strukturierter objekte. ZKI-Informationen Akad. Wiss. DDR 2 82 (1982) 63-122
21. Sobik F. Modellierung von Vergleichsprozessen auf der Grundlage von Ähnlichkeitsmasen für Graphen. ZKI-Informationen, Akad. Wiss. DDR 4 (1986) 104-144
22. Tai K. The tree-to-tree correction problem. J. ACM 26 (1979) 422-433
23. Ullman J.R. An algorithm for subgraph isomorphism. J. ACM 23 1 (1976) 31-42
24. Wang L., and Zhao J. Parametric alignments of ordered trees. Bioinformatics 19 17 (2003) 2237-2245
25. Zelinka B. On a certain distance between isomorphism classes of graphs. Časopis pro p̌est. Mathematiky 100 (1975) 371-373
26. Zhang K., Statman R., and Shasha D. On the editing distance between unordered labeled trees. Int. Inform. Process. Lett. 42 3 (1992) 133-139