A similarity measure for graphs with low computational complexity
From MaRDI portal
Publication:861127
DOI10.1016/J.AMC.2006.04.006zbMATH Open1111.05019OpenAlexW2166251704MaRDI QIDQ861127FDOQ861127
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
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
Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Title not available (Why is that?)
- An Algorithm for Subgraph Isomorphism
- Algorithms on Strings, Trees and Sequences
- Title not available (Why is that?)
- The Tree-to-Tree Correction Problem
- On a certain distance between isomorphism classes of graphs
- Alignment of trees -- an alternative to tree edit
- Inexact graph matching for structural pattern recognition
- On the editing distance between unordered labeled trees
- Title not available (Why is that?)
- The tree-to-tree editing problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (21)
- 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
- A new method of measuring similarity for a special class of directed graphs
- Efficient identifications of structural similarities for graphs
- Structure-based graph distance measures of high degree of precision
- Graph nodes and a definition of structural similarity
- A new dissimilarity measure for comparing labeled graphs
- Fifty years of graph matching, network alignment and network comparison
- Comparing large graphs efficiently by margins of feature vectors
- Measuring Structural Similarities of Graphs in Linear Time
- Structural similarity of directed universal hierarchical graphs: a low computational complexity approach
- Title not available (Why is that?)
- Subgraphs as a measure of similarity
- The domination numbers of cylindrical grid graphs
- 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
- Title not available (Why is that?)
- 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)
