✦ LIBER ✦

Fast massively parallel algorithms for shortest path within planar figures

✍ Scribed by Kapralski, Adam

Book ID: 118783083
Publisher: Springer
Year: 1996
Tongue: English
Weight: 710 KB
Volume: 12
Category: Article
ISSN: 0178-2789
DOI: 10.1007/s003710050081

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient parallel algorithm for shor

An efficient parallel algorithm for shortest paths in planar layered digraphs

✍ S. Subramanian; R. Tamassia; J. S. Vitter 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 942 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