Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
Communications of the ACM
A bridging model for parallel computation
Communications of the ACM
An introduction to parallel algorithms
An introduction to parallel algorithms
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Fast parallel space allocation, estimation, and integer sorting
Information and Computation
Practical parallel algorithms for personalized communication and integer sorting
Journal of Experimental Algorithmics (JEA)
Using selective path-doubling for parallel shortest-path computations
Journal of Algorithms
Algorithmic theory of random graphs
Random Structures & Algorithms - Special issue: average-case analysis of algorithms
A randomized parallel algorithm for single-source shortest paths
Journal of Algorithms
A parallel priority queue with constant time operations
Journal of Parallel and Distributed Computing - Parallel and distributed data structures
Time—work tradeoffs of the single-source shortest paths problem
Journal of Algorithms
Trawling the Web for emerging cyber-communities
WWW '99 Proceedings of the eighth international conference on World Wide Web
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
A random graph model for massive graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Single-source shortest-paths on arbitrary directed graphs in linear average-case time
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The diameter of random massive graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A Parallelization of Dijkstra's Shortest Path Algorithm
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Randomized parallel algorithms
Solving Combinatorial Optimization Problems in Parallel - Methods and Techniques
Parallel Shortest Path for Arbitrary Graphs
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
Delta-Stepping: A Parallel Single Source Shortest Path Algorithm
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A Simple Shortest Path Algorithm with Linear Average Time
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Parallel implementation of geometric shortest path algorithms
Parallel Computing - Special issue: High performance computing with geographical data
| Hi-index | 0.00 |
We study the average-case complexity of the parallel single-source shortest-path (SSSP) problem, assuming arbitrary directed graphs with n nodes, m edges, and independent random edge weights uniformly distributed in [0, 1]. We provide a new bucket-based parallel SSSP algorithm that runs in T =O(log2n 驴mini{2i 驴 L + |Vi|})average-case time using O(n +m +T) work on a PRAM where L denotes the maximum shortest-path weight and |Vi| is the number of graph vertices with in-degree at least 2i. All previous algorithms either required more time or more work. The minimum performance gain is a logarithmic factor improvement; on certain graph classes, accelerations by factors of more than n0.4 can be achieved. The algorithm allows adaptation to distributed memory machines, too.