Properties of graph distance measures by means of discrete inequalities (Q2295900)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7167937
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Properties of graph distance measures by means of discrete inequalities |
scientific article; zbMATH DE number 7167937 |
Statements
Properties of graph distance measures by means of discrete inequalities (English)
0 references
17 February 2020
0 references
distance measures
0 references
similarity measures
0 references
inequalities
0 references
graphs
0 references
networks
0 references
0 references
0.9059038
0 references
0.90561354
0 references
0.90009457
0 references
0.89949906
0 references
0.89927757
0 references
0 references
0.89771026
0 references
0.8952598
0 references
0.89458305
0 references
0.89458305
0 references
