𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[Lecture Notes in Computer Science] Parallel Algorithms for Irregularly Structured Problems Volume 1117 || A simple parallel algorithm for the single-source shortest path problem on planar digraphs

✍ Scribed by Ferreira, Alfonso; Rolim, José; Saad, Yousef; Yang, Tao

Book ID
121511077
Publisher
Springer Berlin Heidelberg
Year
1996
Weight
770 KB
Category
Article
ISBN
3540688080

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

[Lecture Notes in Computer Science] Para
[Lecture Notes in Computer Science] Parallel Computing Technologies Volume 5698 || Associative Version of the Ramalingam Decremental Algorithm for Dynamic Updating the Single-Sink Shortest-Paths Subgraph
✍ Malyshkin, Victor 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 188 KB

The PaCT-2009 (Parallel Computing Technologies) conference was a four-day eventheld in Novosibirsk. This was the tenth internationalconference to be held in the PaCT series. The conferences are held in Russia every odd year. The ?rst conference, PaCT 1991, was held in Novosibirsk (Academgorodok), Se