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. [POSTSCRIPT ] Keyword(s): CRCW, PRAM, Single-source shortest paths.



2. Ramakrishna Thurimella. Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components. Journal of Algorithms, 23(1):160--189, April 1997. [PDF ] Keyword(s): Biconnected components.

1. Steve Goddard, Subodh Kumar, and Jan F. Prins. Connected Components Algorithms For Mesh Connected Parallel Computers. In Sandeep N. Bhatt, editor, Parallel Algorithms, volume 30 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 43--58, 1997. American Mathematical Society. [POSTSCRIPT ] Keyword(s): Connected components, CRCW, PRAM.



2. 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 ] Keyword(s): Single-source shortest paths.



3. Tsan-Sheng Hsu, Vijaya Ramachandran, and Nathaniel Dean. Parallel implementation of algorithms for finding connected components in graphs. In Sandeep N. Bhatt, editor, Parallel Algorithms, volume 30 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 23--42, 1997. American Mathematical Society. [POSTSCRIPT ] Keyword(s): Connected components, CRCW, PRAM.



4. Arvind Krishnamurthy, Steven S. Lumetta, David E. Culler, and Katherine Yelick. Connected components on distributed memory machines. In Sandeep N. Bhatt, editor, Parallel Algorithms, volume 30 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 1--22, 1997. American Mathematical Society. [POSTSCRIPT ] Keyword(s): Connected components, PRAM.



5. 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 ] Keyword(s): Single-source shortest paths.

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