๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient parallel algorithm for shortest paths in planar layered digraphs

โœ Scribed by S. Subramanian; R. Tamassia; J. S. Vitter

Book ID
118289651
Publisher
Springer
Year
1995
Tongue
English
Weight
942 KB
Volume
14
Category
Article
ISSN
0178-4617

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

Efficient Parallel Shortest-Paths in Dig
Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition
โœ Edith Cohen ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 297 KB

We consider 1 shortest-paths and reachability problems on directed graphs with real-valued edge weights. For sparser graphs, the known N N C C algorithms for these problems perform much more work than their sequential counterparts. In this paper we present efficient parallel algorithms for families

An Optimal Shortest Path Parallel Algori
An Optimal Shortest Path Parallel Algorithm for Permutation Graphs
โœ O.H. Ibarra; Q. Zheng ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 512 KB

We present an optimal parallel algorithm for the single-source shortest path problem for permutation graphs. The algorithm runs in \(O(\log n)\) time using \(O(n / \log n)\) processors on an EREW PRAM. As an application, we show that a minimum connected dominating set in a permutation graph can be f