The complexity of the characterization of networks supporting shortest-path interval routing. (Q1853562)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of the characterization of networks supporting shortest-path interval routing. |
scientific article |
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
