A similarity measure for graphs with low computational complexity

DOI10.1016/j.amc.2006.04.006zbMath1111.05019MaRDI QIDQ861127

Frank Emmert-Streib, Matthias Dehmer, Jürgen Kilian

Publication date: 9 January 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.04.006

zbMATH Keywords

isomorphism; graph similarity; generalized tree

Mathematics Subject Classification ID

05C05: Trees

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

Related Items

Similarity in languages and programs, The domination numbers of cylindrical grid graphs, Structure-based graph distance measures of high degree of precision, Structural similarity of directed universal hierarchical graphs: a low computational complexity approach, A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees, Fifty years of graph matching, network alignment and network comparison, Comparing large-scale graphs based on quantum probability theory, A comparative analysis of multidimensional features of objects resembling sets of graphs

Cites Work

• Alignment of trees -- an alternative to tree edit
• On the editing distance between unordered labeled trees
• The tree-to-tree editing problem
• An Algorithm for Subgraph Isomorphism
• The Tree-to-Tree Correction Problem
• Algorithms on Strings, Trees and Sequences
• Inexact graph matching for structural pattern recognition
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item