A similarity measure for graphs with low computational complexity

DOI10.1016/J.AMC.2006.04.006MaRDI QIDQ861127zbMATH OpenOpenAlexFDO

Authors Matthias Dehmer, Frank Emmert-Streib, 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

isomorphismgraph similaritygeneralized tree

Mathematics Subject Classification ID

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

Recommendations

• Structural similarity of directed universal hierarchical graphs: a low computational complexity approach
• Numerical similarity and dissimilarity measures between two trees
• A new method of measuring similarity for a special class of directed graphs
• Comparing large graphs efficiently by margins of feature vectors
• Tools and Algorithms for the Construction and Analysis of Systems

Cites work

• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 3838078 (Why is no real title available?)
• scientific article; zbMATH DE number 4039703 (Why is no real title available?)
• scientific article; zbMATH DE number 3781232 (Why is no real title available?)
• scientific article; zbMATH DE number 3781233 (Why is no real title available?)
• scientific article; zbMATH DE number 3240929 (Why is no real title available?)
• Algorithms on Strings, Trees and Sequences
• Alignment of trees -- an alternative to tree edit
• An Algorithm for Subgraph Isomorphism
• Inexact graph matching for structural pattern recognition
• On a certain distance between isomorphism classes of graphs
• On the editing distance between unordered labeled trees
• The Tree-to-Tree Correction Problem
• The tree-to-tree editing problem

Cited in

(22)

• A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees
• Graph comparison via nonlinear quantum search
• Comparing large-scale graphs based on quantum probability theory
• Structure-based graph distance measures of high degree of precision
• Graph nodes and a definition of structural similarity
• Efficient identifications of structural similarities for graphs
• A new dissimilarity measure for comparing labeled graphs
• A new method of measuring similarity for a special class of directed graphs
• Fifty years of graph matching, network alignment and network comparison
• Comparing large graphs efficiently by margins of feature vectors
• Structural similarity of directed universal hierarchical graphs: a low computational complexity approach
• Measuring Structural Similarities of Graphs in Linear Time
• scientific article; zbMATH DE number 3907592 (Why is no real title available?)
• The domination numbers of cylindrical grid graphs
• Subgraphs as a measure of similarity
• Graph similarity scoring and matching
• Tools and Algorithms for the Construction and Analysis of Systems
• Similarity in languages and programs
• A tree similarity measuring method and its application to ontology comparison
• scientific article; zbMATH DE number 3942812 (Why is no real title available?)
• Graph similarity and approximate isomorphism
• A comparative analysis of multidimensional features of objects resembling sets of graphs

This page was built for publication: A similarity measure for graphs with low computational complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861127)