✦ LIBER ✦

A parallel shortest path algorithm

✍ Scribed by Th. Mohr; C. Pasche

Publisher: Springer Vienna
Year: 1988
Tongue: English
Weight: 565 KB
Volume: 40
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02276912

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Randomized Parallel Algorithm for Sing

A Randomized Parallel Algorithm for Single-Source Shortest Paths

✍ Philip N Klein; Sairam Subramanian 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 179 KB

We give a randomized parallel algorithm for computing single-source shortest paths in weighted digraphs. We show that the exact shortest-path problem can be efficiently reduced to solving a series of approximate shortest-path subproblems. Our algorithm for the approximate shortest-path problem is ba

A sharper analysis of a parallel algorit

A sharper analysis of a parallel algorithm for the all pairs shortest path problem

✍ Qian Ping Gu; Tadao Takaoka 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 457 KB

A Simple Parallel Algorithm for the Sing

A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs

✍ Jesper L. Träff; Christos D. Zaroliagis 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 216 KB

We present a simple parallel algorithm for the single-source shortest path problem in planar digraphs with nonnegative real edge weights. The algorithm runs on the EREW PRAM model of parallel computation in O((n 2= +n 1&= ) log n) time, performing O(n 1+= log n) work for any 0<=<1Â2. The strength of

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

Parallel algorithms for shortest path pr

Parallel algorithms for shortest path problems in polygons

✍ Hossam ElGindy; Michael Goodrich 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 665 KB

A bicriterion shortest path algorithm

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