scientific article
From MaRDI portal
Publication:3960889
zbMath0496.05059MaRDI QIDQ3960889
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (15)
Comparing large graphs efficiently by margins of feature vectors ⋮ 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 ⋮ A similarity measure for graphs with low computational complexity ⋮ Topological mappings between graphs, trees and generalized trees ⋮ On the degeneracy of the Randić entropy and related graph measures ⋮ Probabilistic inequalities for evaluating structural network measures ⋮ Fifty years of graph matching, network alignment and network comparison ⋮ A comparative analysis of multidimensional features of objects resembling sets of graphs ⋮ Structural similarity of directed universal hierarchical graphs: a low computational complexity approach ⋮ On efficient network similarity measures ⋮ A comparative analysis of new graph distance measures and graph edit distance ⋮ On conjectures of network distance measures by using graph spectra ⋮ Properties of graph distance measures by means of discrete inequalities ⋮ Quantitative graph theory: a new branch of graph theory and network science
This page was built for publication: