scientific article; zbMATH DE number 3781233
From MaRDI portal
Publication:3960889
Cited in
(16)- New inequalities for network distance measures by using graph spectra
- 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
- On conjectures of network distance measures by using graph spectra
- On the degeneracy of the Randić entropy and related graph measures
- On efficient network similarity measures
- A comparative analysis of new graph distance measures and graph edit distance
- Properties of graph distance measures by means of discrete inequalities
- Comparing large graphs efficiently by margins of feature vectors
- A comparative analysis of multidimensional features of objects resembling sets of graphs
- Probabilistic inequalities for evaluating structural network measures
- Efficient graph similarity assessment method based on vectors of topological indices
- Quantitative graph theory: a new branch of graph theory and network science
- A similarity measure for graphs with low computational complexity
- Topological mappings between graphs, trees and generalized trees
- Structural similarity of directed universal hierarchical graphs: a low computational complexity approach
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3960889)
