A comparison of three algorithms for approximating the distance distribution in real-world graphs (Q2999337)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A comparison of three algorithms for approximating the distance distribution in real-world graphs |
scientific article; zbMATH DE number 5887542
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A comparison of three algorithms for approximating the distance distribution in real-world graphs |
scientific article; zbMATH DE number 5887542 |
Statements
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs (English)
0 references
12 May 2011
0 references
0.7307615876197815
0 references
0.7217923402786255
0 references
0.7189631462097168
0 references
0.7185758352279663
0 references
0.7180823087692261
0 references
