The following pages link to (Q3960889):
Displaying 15 items.
- Probabilistic inequalities for evaluating structural network measures (Q508736) (← links)
- Quantitative graph theory: a new branch of graph theory and network science (Q780939) (← links)
- A similarity measure for graphs with low computational complexity (Q861127) (← links)
- Topological mappings between graphs, trees and generalized trees (Q884588) (← links)
- Structural similarity of directed universal hierarchical graphs: a low computational complexity approach (Q990638) (← links)
- New inequalities for network distance measures by using graph spectra (Q1630771) (← links)
- A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees (Q1636844) (← links)
- Fifty years of graph matching, network alignment and network comparison (Q1991876) (← links)
- On conjectures of network distance measures by using graph spectra (Q2043383) (← links)
- On the degeneracy of the Randić entropy and related graph measures (Q2224838) (← links)
- On efficient network similarity measures (Q2286037) (← links)
- A comparative analysis of new graph distance measures and graph edit distance (Q2293189) (← links)
- Properties of graph distance measures by means of discrete inequalities (Q2295900) (← links)
- Comparing large graphs efficiently by margins of feature vectors (Q2372051) (← links)
- A comparative analysis of multidimensional features of objects resembling sets of graphs (Q2474878) (← links)
