The Complexity of Interval Routing on Random Graphs (Q3842955)
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 1192540
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Complexity of Interval Routing on Random Graphs |
scientific article; zbMATH DE number 1192540 |
Statements
The Complexity of Interval Routing on Random Graphs (English)
0 references
25 January 1999
0 references
compact routing
0 references
complete routing tables
0 references
0.982435703277588
0 references
0.8814378976821899
0 references
0.846895694732666
0 references
0.8464356660842896
0 references
