1. Philip N. Klein and Sairam Subramanian. A randomized parallel algorithm for single-source shortest paths. Journal of Algorithms, 25(2):205--220, November 1997.
   Keywords: CRCW, PRAM, Single-source shortest paths. [bibtex-entry]



2. K. Ramarao and S. Vekatesan. On finding and updating shortest paths distributively. Journal of Algorithms, 13(2):235--257, June 1992.
   Keywords: Single-source shortest paths. [bibtex-entry]



3. James R. Driscoll, Harold N. Gabow, Ruth Shrairman, and Robert E. Tarjan. Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation. Communications of the ACM, 31(11):1343--1354, 1988. [PDF ]
   Keywords: Single-source shortest paths, EREW, PRAM. [bibtex-entry]



4. Donald B. Johnson. Efficient Algorithms for Shortest Paths in Sparse Networks. Journal of the ACM, 24(1):1--13, 1977. [PDF ]
   Keywords: Single-source shortest paths. [bibtex-entry]

1. Lubos Brim, Ivana Cerná, and Lukás Hejtmánek. Parallel Algorithms for Detection of Negative Cycles. In PARCO, 2003. [PDF ]
   Keywords: Single-source shortest paths. [bibtex-entry]



2. L. Brim, I. Cerná, P. Krcál, and R. Pelánek. How to Employ Reverse Search in Distributed Single-Source Shortest Paths. In L. Pacholski and P. Ruziccka, editors, SOFSEM'01, number 2234 of Lecture Notes in Computer Science, pages 191--200, 2001. Springer Verlag. [PDF ]
   Keywords: Single-source shortest paths. [bibtex-entry]



3. Ulrich Meyer. Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs. In Rizos Sakellariou, John Keane, John R. Gurd, and Len Freeman, editors, 7th International Euro-Par Conference, volume 2150 of Lecture Notes in Computer Science, pages 343--351, August 2001. Springer. [PDF ]
   Keywords: Single-source shortest paths, CRCW, PRAM. [bibtex-entry]



4. Ulrich Meyer and Peter Sanders. Parallel Shortest Path for Arbitrary Graphs. In Proceedings from the 6th International Euro-Par Conference on Parallel Processing, pages 461--470, 2000. Springer-Verlag. [PDF ]
   Keywords: Single-source shortest paths. [bibtex-entry]



5. Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, and Peter Sanders. A Parallelization of Dijkstra's Shortest Path Algorithm. In Lubos Brim, Jozef Gruska, and Jirì Zlatuska, editors, Mathematical Foundations of Computer Science, volume 1450 of Lecture Notes in Computer Science, pages 722--731, 1998. Springer. [PDF ]
   Keywords: Single-source shortest paths, CRCW, PRAM. [bibtex-entry]



6. Michelle Hribar, Valerie Taylor, and David E. Boyce. Performance study of parallel shortest path algorithms: Characteristics of good decompositions. In Proceedings from ISUG '97 Conference, 1997. [PDF ]
   Keywords: Single-source shortest paths. [bibtex-entry]



7. Marios Papaefthymiou and Joseph Rodrigue. Implementing parallel shortest-paths algorithms. In Sandeep N. Bhatt, editor, Parallel Algorithms, volume 30 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 59--68, 1997. American Mathematical Society. [PDF ]
   Keywords: Single-source shortest paths. [bibtex-entry]

1. Lubos Brim, Ivana Cerná, Pavel Krcál, and Radek Pelánek. Distributed Shortest Paths for Directed Graphs with Negative Edge Lengths. Technical report FIMU-RS-2001-01, Faculty of Informatics, Masaryk University, May 2001. [PDF ]
   Keywords: Single-source shortest paths. [bibtex-entry]



2. Michelle Hribar, Valerie Taylor, and David E. Boyce. Parallel Shortest Path Algorithms: Identifying the Factors that Affect Performance. Technical report CPDC-TR-9803-015, Center for Parallel and Distributed Computing, Northwestern University, January 1998.
   Keywords: Single-source shortest paths. [bibtex-entry]

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.

This document was translated from BibT_EX by bibtex2html