✦ LIBER ✦

A note on finding shortest path trees

✍ Scribed by Aaron Kershenbaum

Publisher: John Wiley and Sons
Year: 1981
Tongue: English
Weight: 107 KB
Volume: 11
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230110410

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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 shortest path, assignment, and

A note on shortest path, assignment, and transportation problems

✍ A. J. Hoffman; H. M. Markowitz 📂 Article 📅 1963 🏛 John Wiley and Sons 🌐 English ⚖ 235 KB 👁 1 views

A note on the problem of updating shorte

A note on the problem of updating shortest paths

✍ Satoru Fujishige 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB 👁 1 views

On the complexity of finding paths in a

On the complexity of finding paths in a two-dimensional domain I: Shortest paths

✍ Arthur W. Chou; Ker-I Ko 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 342 KB 👁 2 views

## Abstract The computational complexity of finding a shortest path in a two‐dimensional domain is studied in the Turing machine‐based computational model and in the discrete complexity theory. This problem is studied with respect to two formulations of polynomial‐time computable two‐dimensional do

A scalable multicast routing protocol fo

A scalable multicast routing protocol for building shortest path trees

✍ Baoxian Zhang; Jun Zheng; Hussein T. Mouftah 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 220 KB 👁 1 views

## Abstract Scalability is a great concern in the design of multicast routing protocols for the global Internet. Building shortest path trees (SPT) is currently one of the most widely used approaches to supporting multicast routing because of the simplicity and low per‐destination cost of such tree