𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Shortest path and closure algorithms for banded matrices

✍ Scribed by L. Allison; T.I. Dix; C.N. Yee

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
911 KB
Volume
40
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Dual algorithms for the shortest path tr
Dual algorithms for the shortest path tree problem
✍ Pallottino, Stefano; ScutellοΏ½, Maria Grazia πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 117 KB πŸ‘ 2 views

We consider dual approaches for the Shortest Path Tree problem. After a brief introduction to the problem, we review the most important dual algorithms which have been described in the literature for its solution and propose a new family of dual ascent algorithms. In these algorithms, ''local'' and

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