Δ-step**: a parallelizable shortest path algorithm
The single source shortest path problem for arbitrary directed graphs with n nodes, m edges
and nonnegative edge weights can sequentially be solved using O (n· log n+ m) operations …
and nonnegative edge weights can sequentially be solved using O (n· log n+ m) operations …
Julienne: A framework for parallel graph algorithms using work-efficient bucketing
Existing graph-processing frameworks let users develop efficient implementations for many
graph problems, but none of them support efficiently bucketing vertices, which is needed for …
graph problems, but none of them support efficiently bucketing vertices, which is needed for …
A parallelization of Dijkstra's shortest path algorithm
The single source shortest path (SSSP) problem lacks parallel solutions which are fast and
simultaneously work-efficient. We propose simple criteria which divide Dijkstra's sequential …
simultaneously work-efficient. We propose simple criteria which divide Dijkstra's sequential …
Parallel approximate undirected shortest paths via low hop emulators
We present a (1+ ε)-approximate parallel algorithm for computing shortest paths in
undirected graphs, achieving poly (log n) depth and m poly (log n) work for n-nodes m …
undirected graphs, achieving poly (log n) depth and m poly (log n) work for n-nodes m …
The spraylist: A scalable relaxed priority queue
High-performance concurrent priority queues are essential for applications such as task
scheduling and discrete event simulation. Unfortunately, even the best performing …
scheduling and discrete event simulation. Unfortunately, even the best performing …
[BOG][B] Sequential and Parallel Algorithms and Data Structures
viii Preface reason for this change is that sequential processors have ceased to get
proportional performance improvements from increased circuit complexity. Although the …
proportional performance improvements from increased circuit complexity. Although the …
A faster distributed single-source shortest paths algorithm
S Forster, D Nanongkai - 2018 IEEE 59th Annual Symposium …, 2018 - ieeexplore.ieee.org
We devise new algorithms for the single-source shortest paths (SSSP) problem with non-
negative edge weights in the CONGEST model of distributed computing. While close-to …
negative edge weights in the CONGEST model of distributed computing. While close-to …
Near-optimal approximate shortest paths and transshipment in distributed and streaming models
R Becker, S Forster, A Karrenbauer… - ar** : A Parallel Single Source Shortest Path Algorithm
In spite of intensive research, little progress has been made towards fast and work-efficient
parallel algorithms for the single source shortest path problem. Our Δ-step** algorithm, a …
parallel algorithms for the single source shortest path problem. Our Δ-step** algorithm, a …
An experimental study of a parallel shortest path algorithm for solving large-scale graph instances
We present an experimental study of the single source shortest path problem with non-
negative edge weights (NSSP) on large-scale graphs using the Δ-step** parallel …
negative edge weights (NSSP) on large-scale graphs using the Δ-step** parallel …