On the complexity of greedy routing in ring-based peer-to-peer networks (Q5401398)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6269559
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of greedy routing in ring-based peer-to-peer networks |
scientific article; zbMATH DE number 6269559 |
Statements
On the complexity of greedy routing in ring-based peer-to-peer networks (English)
0 references
13 March 2014
0 references
coupling
0 references
greedy routing
0 references
lower bound
0 references
peer-to-peer
0 references
random graphs
0 references
small-worlds
0 references
0 references
0.8796853
0 references
0.87891686
0 references
0.8783641
0 references
0.87818027
0 references
