Parallel shortest path for arbitrary graphs

Abstract

In spite of intensive research, no work-efficient parallel algorithm for the single source shortest path problem is known which works in sublinear time for arbitrary directed graphs with non-negative edge weights. W e present an algorithm that improves this situation for graphs where the ratio dc/Δ between the maximum weight of a shortest path dc and a “safe step width” Δ is not too large. W e show how such a step width can be found efficiently and give several graph classes which meet the above condition, such that our parallel shortest path algorithm runs in sublinear time and uses linear work. The new algorithm is even faster than a previous one which only works for random graphs with random edge weights [10].O n those graphs our new approach is faster by a factor of Θ(log n/log logn) and achieves an expected time bound of O(log2 n) using linear work.