Meyer, Ulrich Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Sanders, Peter Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Meyer, U., & Sanders, P. (2000). Parallel Shortest Path for Arbitrary Graphs. In A. Bode, T. Ludwig, W. Karl, & R. Wismüller (Eds.), Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00) (pp. 461-470). Berlin, Germany: Springer.