Converting a network into a small-world network: fast algorithms for minimizing average path length through link addition (Q781014)
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: Converting a network into a small-world network: fast algorithms for minimizing average path length through link addition |
scientific article; zbMATH DE number 7221605
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Converting a network into a small-world network: fast algorithms for minimizing average path length through link addition |
scientific article; zbMATH DE number 7221605 |
Statements
Converting a network into a small-world network: fast algorithms for minimizing average path length through link addition (English)
0 references
16 July 2020
0 references
0.7679892182350159
0 references
0.7561269402503967
0 references
0.7480896711349487
0 references
0.7225849032402039
0 references
0.7189058661460876
0 references
