𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bottleneck shortest paths on a partially ordered scale

✍ Scribed by Jérôme Monnot; Olivier Spanjaard

Book ID
106308094
Publisher
Springer
Year
2003
Tongue
English
Weight
194 KB
Volume
1
Category
Article
ISSN
1619-4500

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on k-shortest paths problem
A note on k-shortest paths problem
✍ Nick Gravin; Ning Chen 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 66 KB 👁 1 views

It is well-known that in a directed graph, if deleting any edge will not affect the shortest distance between two specific vertices s and t, then there are two edge-disjoint paths from s to t and both of them are shortest paths. In this article, we generalize this to shortest k edgedisjoint s-t path

On finding shortest paths in nonnegative
On finding shortest paths in nonnegative networks
✍ A. Rosenthal 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 438 KB

A modification of Dantzig's algorithm for the all! pairs shortest paths problem is given. The new algorithm applies only to graphs with nonnegative arc lengths. For an IV-node compkte graph ir has a worst case running time of fN3 triple operations of the form D-: = min(D--D-~+D~$ and iv" log N other