The complexity of the characterization of networks supporting shortest-path interval routing. (Q1853562)
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: The complexity of the characterization of networks supporting shortest-path interval routing. |
scientific article; zbMATH DE number 1857092
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of the characterization of networks supporting shortest-path interval routing. |
scientific article; zbMATH DE number 1857092 |
Statements
The complexity of the characterization of networks supporting shortest-path interval routing. (English)
0 references
21 January 2003
0 references
Interval routing
0 references
Compact routing
0 references
Communication networks
0 references
0 references
0.92534035
0 references
0.91692585
0 references
0.9084539
0 references
0.89870316
0 references
0.8955138
0 references
0.8955138
0 references
0 references
0.8923104
0 references
0.8923104
0 references
