On computing the diameter of real-world undirected graphs (Q386904)
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: On computing the diameter of real-world undirected graphs |
scientific article; zbMATH DE number 6237344
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On computing the diameter of real-world undirected graphs |
scientific article; zbMATH DE number 6237344 |
Statements
On computing the diameter of real-world undirected graphs (English)
0 references
11 December 2013
0 references
breadth-first search
0 references
diameter
0 references
complex network
0 references
experimental analysis
0 references
0 references
0.8565974831581116
0 references
0.8472712635993958
0 references
0.8370338678359985
0 references
0.8350415229797363
0 references
0.8147296905517578
0 references
