6533b827fe1ef96bd1285a35
RESEARCH PRODUCT
Implementation of algorithms forK shortest loopless paths
Aarni Perkosubject
Computer Networks and CommunicationsHardware and ArchitectureShortest path problemK shortest path routingFloyd–Warshall algorithmAlgorithmFast algorithmYen's algorithmSoftwareInformation SystemsMathematicsdescription
Implementations of loopless k shortest path algorithms are examined. Efficient storage structures for a large number of paths are given. A fast algorithm for determining the shortest paths in Yen's method is developed. Timing experiments show that a hybrid of Clarke's and Yen's methods is generally the fastest, although not significantly. Using upper bounds for the lengths of paths essentially improves all methods.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 1986-01-01 | Networks |