Pages that link to "Item:Q2295900"
From MaRDI portal
The following pages link to Properties of graph distance measures by means of discrete inequalities (Q2295900):
Displaying 7 items.
- Probabilistic inequalities for evaluating structural network measures (Q508736) (← links)
- Structure-based graph distance measures of high degree of precision (Q947972) (← links)
- New inequalities for network distance measures by using graph spectra (Q1630771) (← links)
- A proof of the triangle inequality for the Tanimoto distance (Q1977966) (← links)
- On efficient network similarity measures (Q2286037) (← links)
- A comparative analysis of new graph distance measures and graph edit distance (Q2293189) (← links)
- A Linear-Time Algorithm and Analysis of Graph Relative Hausdorff Distance (Q5025764) (← links)