A Randomized Algorithm for Single-Source Shortest Path on Undirected Real-Weighted Graphs

07/09/2023
by   Ran Duan, et al.
0

In undirected graphs with real non-negative weights, we give a new randomized algorithm for the single-source shortest path (SSSP) problem with running time O(m√(log n ·loglog n)) in the comparison-addition model. This is the first algorithm to break the O(m+nlog n) time bound for real-weighted sparse graphs by Dijkstra's algorithm with Fibonacci heaps. Previous undirected non-negative SSSP algorithms give time bound of O(mα(m,n)+min{nlog n, nloglog r}) in comparison-addition model, where α is the inverse-Ackermann function and r is the ratio of the maximum-to-minimum edge weight [Pettie Ramachandran 2005], and linear time for integer edge weights in RAM model [Thorup 1999]. Note that there is a proposed complexity lower bound of Ω(m+min{nlog n, nloglog r}) for hierarchy-based algorithms for undirected real-weighted SSSP [Pettie Ramachandran 2005], but our algorithm does not obey the properties required for that lower bound. As a non-hierarchy-based approach, our algorithm shows great advantage with much simpler structure, and is much easier to implement.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset