✦ LIBER ✦

Parallel Algorithms for Dynamic Shortest Path Problems

✍ Scribed by Ismail Chabini; Sridevi Ganugapati

Book ID: 108572771
Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 174 KB
Volume: 9
Category: Article
ISSN: 0969-6016
DOI: 10.1111/1475-3995.00356

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel algorithms for shortest path pr

Parallel algorithms for shortest path problems in polygons

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

Parallel algorithms for the single sourc

Parallel algorithms for the single source shortest path problem

✍ P. Mateti; N. Deo 📂 Article 📅 1982 🏛 Springer Vienna 🌐 English ⚖ 880 KB

Parallel Asynchronous Algorithms for the

Parallel Asynchronous Algorithms for the K Shortest Paths Problem

✍ F. Guerriero; R. Musmanno 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 537 KB

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

A parallel shortest path algorithm

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

Optimal parallel algorithm for shortest-

Optimal parallel algorithm for shortest-paths problem on interval graphs

✍ P. K. Mishra 📂 Article 📅 2004 🏛 SP Zhejiang University Press 🌐 English ⚖ 688 KB