OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS (Q3511034)
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: OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS |
scientific article |
Statements
OPTIMAL PATH AND MINIMAL SPANNING TREES IN RANDOM WEIGHTED NETWORKS (English)
0 references
4 July 2008
0 references
minimum spanning tree
0 references
percolation
0 references
scale-free
0 references
optimization
0 references
0.94181985
0 references
0.9129158
0 references
0.9104282
0 references
0.9101397
0 references
0.9057094
0 references
0 references
0.9018358
0 references
