✦ LIBER ✦

Implementation of algorithms for K shortest loopless paths

✍ Scribed by Aarni Perko

Publisher: John Wiley and Sons
Year: 1986
Tongue: English
Weight: 641 KB
Volume: 16
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230160204

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

An efficient algorithm for K shortest si

An efficient algorithm for K shortest simple paths

✍ N. Katoh; T. Ibaraki; H. Mine 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 878 KB

An efficient implementation of an algori

An efficient implementation of an algorithm for findingK shortest simple paths

✍ Hadjiconstantinou, E.; Christofides, N. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 263 KB 👁 1 views

In this article, we present an efficient computational implementation of an algorithm for finding the K shortest simple paths connecting a pair of vertices in an undirected graph with n vertices, m arcs, and nonnegative arc lengths. A minimal number of intermediate paths is formed based on the metho

Approximation algorithms for some k-sour

Approximation algorithms for some k-source shortest paths spanning tree problems

✍ Yen Hung Chen; Bang Ye Wu; Chuan Yi Tang 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 206 KB

Fully Dynamic Algorithms for Maintaining

Fully Dynamic Algorithms for Maintaining Shortest Paths Trees

✍ Daniele Frigioni; Alberto Marchetti-Spaccamela; Umberto Nanni 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 213 KB

We propose fully dynamic algorithms for maintaining the distances and the shortest paths from a single source in either a directed or an undirected graph with positive real edge weights, handling insertions, deletions, and weight updates of edges. The algorithms require linear space and optimal quer

Faster Shortest-Path Algorithms for Plan

Faster Shortest-Path Algorithms for Planar Graphs

✍ Monika R Henzinger; Philip Klein; Satish Rao; Sairam Subramanian 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 445 KB

We give a linear-time algorithm for single-source shortest paths in planar graphs with nonnegative edge-lengths. Our algorithm also yields a linear-time algorithm for maximum flow in a planar graph with the source and sink on the same face. For the case where negative edge-lengths are allowed, we gi

Termination Detection for Parallel Short

Termination Detection for Parallel Shortest Path Algorithms

✍ Michelle R Hribar; Valerie E Taylor; David E Boyce 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 322 KB

Shortest path computation is required by a large number of applications such as VLSI, transportation, and communication networks. These applications, which are often very complex and have sparse networks, generally use parallel labeling shortest path algorithms. Such algorithms, when implemented on