# More Parallelism in Dijkstra's Single-Source Shortest Path Algorithm

@article{Kainer2019MorePI, title={More Parallelism in Dijkstra's Single-Source Shortest Path Algorithm}, author={Michael Kainer and Jesper Larsson Tr{\"a}ff}, journal={ArXiv}, year={2019}, volume={abs/1903.12085} }

Dijkstra's algorithm for the Single-Source Shortest Path (SSSP) problem is notoriously hard to parallelize in $o(n)$ depth, $n$ being the number of vertices in the input graph, without increasing the required parallel work unreasonably. Crauser et al.\ (1998) presented observations that allow to identify more than a single vertex at a time as correct and correspondingly more edges to be relaxed simultaneously. Their algorithm runs in parallel phases, and for certain random graphs they showed… Expand

#### Figures, Tables, and Topics from this paper

#### One Citation

Efficient Parallel Shortest Path Algorithms

- Computer Science
- 2020 19th International Symposium on Parallel and Distributed Computing (ISPDC)
- 2020

Novel algorithms are presented that leverage constraints to solve the problem faster and more efficiently in key metrics and compare favorably to $\triangle$-stepping algorithm in the ability to establish the shortest path between the source and the median node. Expand

#### References

SHOWING 1-10 OF 23 REFERENCES

A Parallelization of Dijkstra's Shortest Path Algorithm

- Computer Science, Mathematics
- MFCS
- 1998

A PRAM algorithm is given based on Dijkstra's sequential SSSP algorithm into a number of phases, such that the operations within a phase can be done in parallel. Expand

Removing Sequential Bottleneck of Dijkstra's Algorithm for the Shortest Path Problem

- Computer Science
- ArXiv
- 2018

A method which maintains lower bounds as well as upper bounds for reaching a vertex is introduced which enables one to find the optimal cost for multiple vertices in one iteration and thereby reduces the sequential bottleneck in Dijkstra's algorithm. Expand

Parallel Shortest Paths Using Radius Stepping

- Computer Science, Mathematics
- SPAA
- 2016

The single-source shortest path problem (SSSP) with nonnegative edge weights is notoriously difficult to solve efficiently in parallel---it is one of the graph problems said to suffer from the… Expand

Δ-stepping: a parallelizable shortest path algorithm

- Computer Science, Mathematics
- 2003

A rather simple algorithm for the single source shortest path problem, which the authors call Delta-stepping, can be implemented very efficiently in sequential and parallel setting for a large class of graphs and achieves significant speedup on real machines. Expand

[Delta]-stepping: a parallelizable shortest path algorithm

- Mathematics, Computer Science
- J. Algorithms
- 2003

A rather simple algorithm for the single source shortest path problem, which the authors call Delta-stepping, can be implemented very efficiently in sequential and parallel setting for a large class of graphs and achieves significant speedup on real machines. Expand

Undirected single-source shortest paths with positive integer weights in linear time

- Mathematics, Computer Science
- JACM
- 1999

A deterministic linear time and linear space algorithm is presented for the undirected single source shortest paths problem with positive integer weights, which avoids the sorting bottleneck by building a hierarchical bucketing structure. Expand

Improved Shortest Paths on the Word RAM

- Mathematics, Computer Science
- ICALP
- 2000

It is shown that the component tree for an undirected network can be constructed in deterministic linear time and space with a simple algorithm, to be contrasted with a complicated and impractical solution suggested by Thorup. Expand

Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds

- Mathematics, Computer Science
- J. Algorithms
- 2003

This work gives the first label-setting and label-correcting algorithms that run in linear time O(n + m) on the average of single-source shortest-path algorithms assuming arbitrary directed graphs with n nodes, m edges, and independent random edge weights uniformly distributed in [0,1]. Expand

A Practical Shortest Path Algorithm with Linear Expected Time

- Computer Science, Mathematics
- SIAM J. Comput.
- 2008

An improvement of the multilevel bucket shortest path algorithm of Denardo and Fox is presented and it is proved that if the input arc lengths come from a natural probability distribution, the new algorithm runs in linear average time while the original algorithm does not. Expand

A Parallel Priority Queue with Constant Time Operations

- Computer Science
- J. Parallel Distributed Comput.
- 1998

This data structure is the first to support multi-insertion and multi-decrease key in constant time, and can be implemented on the EREW PRAM and can perform any sequence of operations inO(n) time andO(mlogn) work, being the total number of keyes inserted and/or updated. Expand