Searching for "Parallel Algorithms for Shortest Path Problems." – sorted by Relevance.
-
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
- A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
- Cited by 16 (3 self) – Add To MetaCart
-
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
- A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs Jesper L
- Add To MetaCart
-
An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs
- parallel algorithm for the shortest path problem in such digraphs that runs in O(log 3 n) time with n
- Cited by 1 (0 self) – Add To MetaCart
-
Randomized Parallel Algorithms
- present a randomized parallel algorithm for the shortest path problem for unweighted graph due to Ullmann
- Cited by 3 (0 self) – Add To MetaCart
-
Computing Geodesic Properties Inside a Simple Polygon
- ] ElGindy, H., "A parallel algorithm for the shortest path problem in monotone polygons, " Tech. Rept
- Cited by 13 (2 self) – Add To MetaCart
-
Resume
- Implementation and Performance Evaluation of Efficient Parallel Algorithms for Shortest Path Problem on MasPar MP
- Add To MetaCart
-
Parallel Depth First Search, Part II: Analysis
- for the shortest path problem[11], parallel quicksort[11]), it is possible to obtain linear speedup on arbitrarily
- Cited by 42 (16 self) – Add To MetaCart
-
Fourth Biennial Report
- .D. student Uli Meyer contributed to parallel algorithms for the shortest path problem, to external memory
- Add To MetaCart
-
A Divide-and-Conquer Approach to Shortest Paths in Planar Layered Digraphs
- parallel algorithm for the shortest path problem in such digraphs that runs in O(log 3 n) time with n
- Add To MetaCart

