✦ LIBER ✦

A note on the partitioning shortest path algorithm

✍ Scribed by Martin Desrochers

Book ID: 107918122
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 489 KB
Volume: 6
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(87)90017-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new variant of the partitioning shorte

A new variant of the partitioning shortest path algorithm

✍ Nancy V. Phillips 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 370 KB

A bicriterion shortest path algorithm

✍ João Carlos Namorado Climaco; Ernesto Queirós Vieira Martins 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 386 KB

A parallel shortest path algorithm

✍ Th. Mohr; C. Pasche 📂 Article 📅 1988 🏛 Springer Vienna 🌐 English ⚖ 565 KB

A note on finding shortest path trees

✍ Aaron Kershenbaum 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB 👁 1 views

A note on the constrained shortest-path

A note on the constrained shortest-path problem

✍ Arun K. Pujari; Suneeta Agarwal; V. P. Gulati 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB 👁 1 views

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