✦ LIBER ✦

A note on the shortest path through a given link in a network

✍ Scribed by Lau, H.

Book ID: 114613935
Publisher: IEEE
Year: 1986
Weight: 163 KB
Volume: 33
Category: Article
ISSN: 0098-4094
DOI: 10.1109/tcs.1986.1085822

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on finding shortest path trees

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

A note on the partitioning shortest path

A note on the partitioning shortest path algorithm

✍ Martin Desrochers 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 489 KB

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

The fuzzy shortest path length and the c

The fuzzy shortest path length and the corresponding shortest path in a network

✍ Tzung-Nan Chuang; Jung-Yuan Kung 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 262 KB

A note on Arc tolerances in sparse short

A note on Arc tolerances in sparse shortest-path and network flow problems

✍ Dan Gusfield 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 298 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