A k shortest path algorithm for adaptive routing in communications networks (Q3801304)
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 4068577
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A k shortest path algorithm for adaptive routing in communications networks |
scientific article; zbMATH DE number 4068577 |
Statements
A k shortest path algorithm for adaptive routing in communications networks (English)
0 references
1988
0 references
shortest loopless paths
0 references
adaptive routing
0 references
communication networks
0 references
delta routing
0 references
Low-order polynomial bounds
0 references
worst case time complexity
0 references
network survivability measures
0 references
0.8334460854530334
0 references
0.7760078310966492
0 references
0.768385648727417
0 references
0.767569899559021
0 references
