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. We present an algorithm that improves this situation for graphs where the ratio d c /Δ between the maximum weight of a shortest path d c and a “safe step width” Δ is not too large. We 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]. On those graphs our new approach is faster by a factor of Θ(log n/loglog n) and achieves an expected time bound of \( \mathcal{O}(\log ^2 n) \) using linear work.
Partially supported by the IST Programme of the EU under contract number IST-1999-14186 (ALCOM-FT).
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network flows: theory, algorithms and applications. Prentice Hall, Englewood Cliffs, NJ, 1993.
H. Bast and T. Hagerup. Fast and reliable parallel hashing. In 3rd Symposium on Parallel Algorithms and Architectures, pages 50–61, 1991.
Edith Cohen. Efficient parallel shortest-paths in digraphs with a separator decomposition. Journal of Algorithms, 21(2):331–357, September 1996.
J. Diaz, J. Petit, and M. Serna. Random geometric problems on [0,1]2. In RANDOM: International Workshop on Randomization and Approximation Techniques in Computer Science, volume 1518, pages 294–306. Springer, 1998.
E.W. Dijkstra. A note on two problems in connexion with graphs. Num. Math., 1:269–271, 1959.
E. A. Dinic. Economical algorithms for finding shortest paths in a network. In Transportation Modeling Systems, pages 36–44, 1978.
J. R. Driscoll, H. N. Gabow, R. Shrairman, and R. E. Tarjan. Relaxed heaps: An alternative to fibonacci heaps with applications to parallel computation. Communications of the ACM, 31, 1988.
Y. Han, V. Pan, and J. Reif. Efficient parallel algorithms for computing all pair shortest paths in directed graphs. In Proceedings of the 4th Annual Symposium on Parallel Algorithms and Architectures, pages 353–362, San Diego, CA, USA, June 1992. ACM Press.
Joseph Jájá. An Introduction to Parallel Algorithms. Addison-Wesley, Reading, 1992.
U. Meyer and P. Sanders. Δ-stepping: A parallel shortest path algorithm. In 6th European Symposium on Algorithms (ESA), number 1461 in LNCS, pages 393–404. Springer, 1998.
U. Meyer and P. Sanders. Δ-stepping: A parallelizable shortest path algorithm. http://www.mpi-sb.mpg.de/~sanders/papers/long-delta.ps.gz, 1999.
J. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
S. Rajasekaran and J. H. Reif. Optimal and sublogarithmic time randomized parallel sorting algorithms. SI AM Journal on Computing, 18(3):594–607, 1989.
R. Sedgewick and J. S. Vitter. Shortest paths in euclidean graphs. Algorithmica, 1:31–48, 1986.
Jesper Larsson Träff and Christos D. Zaroliagis. A simple parallel algorithm for the single-source shortest path problem on planar digraphs. In Parallel algorithms for irregularly structured problems: Intern. workshop (IRREGULAR-3), volume LNCS 1117, pages 183–194S., Berlin, 1996. Springer.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meyer, U., Sanders, P. (2000). Parallel Shortest Path for Arbitrary Graphs. In: Bode, A., Ludwig, T., Karl, W., Wismüller, R. (eds) Euro-Par 2000 Parallel Processing. Euro-Par 2000. Lecture Notes in Computer Science, vol 1900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44520-X_61
Download citation
DOI: https://doi.org/10.1007/3-540-44520-X_61
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67956-1
Online ISBN: 978-3-540-44520-3
eBook Packages: Springer Book Archive