Non-searchability of random scale-free graphs (Q5401475)
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: Non-searchability of random scale-free graphs |
scientific article; zbMATH DE number 6269618
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-searchability of random scale-free graphs |
scientific article; zbMATH DE number 6269618 |
Statements
Non-searchability of random scale-free graphs (English)
0 references
13 March 2014
0 references
distributed algorithms
0 references
routing
0 references
scale-free graph
0 references
0.7753868699073792
0 references
0.7753867506980896
0 references
0.7469239234924316
0 references
0.7435043454170227
0 references
0.742949366569519
0 references
