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

All traditional methods of computing shortest paths depend upon edge-relaxation where the cost of reaching a vertex from a source vertex is possibly decreased if that edge is used. We introduce a method which maintains lower bounds as well as upper bounds for reaching a vertex. This method enables one to find the optimal cost for multiple vertices in one iteration and thereby reduces the sequential bottleneck in Dijkstra's algorithm. We present four algorithms in this paper --- SP_1, SP_2, SP_3 and SP_4. SP_1 and SP_2 reduce the number of heap operations in Dijkstra's algorithm. For directed acyclic graphs, or directed unweighted graphs they have the optimal complexity of O(e) where e is the number of edges in the graph which is better than that of Dijkstra's algorithm. For general graphs, their worst case complexity matches that of Dijkstra's algorithm for a sequential implementation but allows for greater parallelism. Algorithms SP_3 and SP_4 allow for even more parallelism but with higher work complexity. Algorithm SP_3 requires O(n + e(( n, Δ))) work where n is the number of vertices and Δ is the maximum in-degree of a node. Algorithm SP_4 has the most parallelism. It requires O(ne) work. These algorithms generalize the work by Crauser, Mehlhorn, Meyer, and Sanders on parallelizing Dijkstra's algorithm.

research
08/07/2021

### An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs

A straightforward dynamic programming method for the single-source short...
research
01/15/2018

### Searching for Maximum Out-Degree Vertices in Tournaments

A vertex x in a tournament T is called a king if for every vertex y of T...
research
12/11/2019

### Efficient Construction of Directed Hopsets and Parallel Approximate Shortest Paths

The approximate single-source shortest-path problem is as follows: given...
research
10/02/2018

### Efficient Fastest-Path Computations in Road Maps

In the age of real-time online traffic information and GPS-enabled devic...
research
11/15/2019

### Delta-stepping SSSP: from Vertices and Edges to GraphBLAS Implementations

GraphBLAS is an interface for implementing graph algorithms. Algorithms ...
research
06/28/2019

### Pruned Landmark Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage!

In this paper, we study how the Pruned Landmark Labeling (PPL) algorithm...
research
11/22/2020

### Algorithmic upper bounds for graph geodetic number

Graph theoretical problems based on shortest paths are at the core of re...