Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs (original) (raw)
Related papers
A parallelization of Dijkstra's shortest path algorithm
Lecture Notes in Computer Science, 1998
An Experimental Study of a Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances
2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX), 2007
A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
Journal of Parallel and Distributed Computing, 2000
Single-source shortest paths with the parallel boost graph library
The Ninth DIMACS …, 2006
Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture
2007 IEEE International Parallel and Distributed Processing Symposium, 2007
Parallel shortest path algorithms for solving large-scale instances
9th DIMACS Implementation …, 2006
Scalability of parallel algorithms for the all-pairs shortest-path problem* 1
Journal of Parallel and Distributed Computing, 1991
Scalability of Parallel Algorithms for the All-Pairs Shortest-Path Problem
Journal of Parallel and Distributed Computing, 1991
Shortest-Path Routing in Arbitrary Networks
Journal of Algorithms, 1999
Performance of Thorup's Shortest Path Algorithm for Large-Scale Network Simulation
IEICE Transactions on Communications, 2012
Scalability of Parallel Algorithms for the All-Pairs Shortest Path Problem: A Summary of Results
1990
Shortest node-disjoint paths on random graphs
Journal of Statistical Mechanics: Theory and Experiment, 2014
Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms
Theoretical Computer Science, 1998
Faster algorithms for the shortest path problem
Journal of the ACM, 1990
Speeding up shortest path algorithms
2012
An external memory data structure for shortest path queries
Discrete Applied Mathematics, 2003
COMPARATIVE STUDY ON SINGLE SOURCE SHORTEST PATH ALGORITHM
An Efficient Parallel Algorithm for Shortest Paths in Planar Layered Digraphs I
Average-case complexity of shortest-paths problems in the vertex-potential model
2000
Randomized routing on fat-trees
Advances in Computing Research, 1989
Expected parallel time and sequential space complexity of graph and digraph problems
Algorithmica, 1992
PERFORMANCE EVALUATION OF ALL PAIR SHORTEST PATH PARALLEL ALGORITHM USED IN BIG DATA
All-Pairs Shortest-Paths Problem For Unweighted Graphs In O(N2 Log N) Time
2009
Performance Study of a Parallel Shortest Path Algorithm
A single-source shortest path algorithm for dynamic graphs
AKCE International Journal of Graphs and Combinatorics
Performance Study of Parallel Shortest Path Algorithms: Characteristics of Good Decompositions
Proc. 13th Ann. Conf. Intel Supercomputers …, 1997
The most likely path on series-parallel networks
Networks, 2011
Efficient parallel algorithms for shortest paths in planar digraphs
BIT, 1992
Shortest Path Analysis for Efficient Traversal Queries in Large Networks
Task Level Parallelization of All Pair Shortest Path Algorithm in OpenMP 3.0
Proceedings of the 2nd International Conference on Advances in Computer Science and Engineering, 2013
Randomized Shortest-Path Problems: A first study
Citeseer
External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs
2004