A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees
From MaRDI portal
(Redirected from Publication:1636844)
Recommendations
- A comparative analysis of new graph distance measures and graph edit distance
- Numerical similarity and dissimilarity measures between two trees
- Fast similarity search for graphs by edit distance
- A similarity measure for graphs with low computational complexity
- Network similarity measure and Ediz eccentric connectivity index
Cites work
- A new method of measuring similarity for a special class of directed graphs
- A similarity measure for graphs with low computational complexity
- Comparing large graphs efficiently by margins of feature vectors
- Distances and volumina for graphs
- Graph energy
- scientific article; zbMATH DE number 4174951 (Why is no real title available?)
- scientific article; zbMATH DE number 3703996 (Why is no real title available?)
- scientific article; zbMATH DE number 3781233 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3639162 (Why is no real title available?)
- scientific article; zbMATH DE number 3798869 (Why is no real title available?)
- scientific article; zbMATH DE number 3439834 (Why is no real title available?)
- scientific article; zbMATH DE number 1890092 (Why is no real title available?)
- scientific article; zbMATH DE number 5259316 (Why is no real title available?)
- Inexact graph matching for structural pattern recognition
- Multivariate image similarity in the compressed domain using statistical graph matching
- On a certain distance between isomorphism classes of graphs
- On graph kernels: hardness results and efficient alternatives.
- Parallel concepts in graph theory
- Structural similarity of directed universal hierarchical graphs: a low computational complexity approach
- Tools and Algorithms for the Construction and Analysis of Systems
Cited in
(4)- Comparing large-scale graphs based on quantum probability theory
- A comparative analysis of new graph distance measures and graph edit distance
- An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants
- scientific article; zbMATH DE number 61573 (Why is no real title available?)
This page was built for publication: A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1636844)