BACK TO INDEX

Publications about 'Connected components'
Articles in journal, book chapters
  1. F. Dehne, A. Ferreira, E. Cáceres, S. W. Song, and A. Roncato. Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP. Algorithmica, 33(2):183-200, January 2002. [PDF] Keyword(s): List ranking, Euler tour, Connected components, Lowest common ancestor, CGM, BSP.


Conference articles
  1. Albert Chan and Frank Dehne. CGM graph/CGM lib: Implementing and Testing CGM Graph Algorithms on PC Clusters. In PVM/MPI, pages 117-125, 2003. [PDF] Keyword(s): List ranking, Euler tour, Connected components, Bipartite detection, CGM, CGMgraph.


  2. Libor Bus and Pavel Tvrdìk. A Parallel Algorithm for Connected Components on Distributed Memory Machines. In Proceedings of the 8th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface, pages 280-287, 2001. Springer-Verlag. ISBN: 3-540-42609-4. [PDF] Keyword(s): CGM, Connected components.


  3. William C. McLendon III, Bruce Hendrickson, Steve Plimpton, and Lawrence Rauchwerger. Identifying strongly connected components in parallel. In Proceedings of the 10th SIAM Conference on Parallel Processing for Scientific Computing, March 2001. [POSTSCRIPT] Keyword(s): Strongly connected components, STAPL.


  4. Lisa Fleischer, Bruce Hendrickson, and Ali Pinar. On Identifying Strongly Connected Components in Parallel. In Parallel and Distributed Processing (IPDPS), volume 1800 of Lecture Notes in Computer Science, pages 505-511, 2000. Springer. [POSTSCRIPT] Keyword(s): Strongly connected components.


  5. Afonso Ferreira, Isabelle Guerin Lassous, K. Marcus, and Andrew Rau-Chaplin. Parallel Computation on Interval Graphs Using PC Clusters: Algorithms and Experiments. In European Conference on Parallel Processing, pages 875-886, 1998. [POSTSCRIPT] Keyword(s): Interval graph, Connected components, Maximum Weighted Clique, Breadth-first Search, Depth-first Search, CGM.


  6. 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. [PDF] Keyword(s): Connected components, CRCW, PRAM.


  7. 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.


  8. 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.


  9. Armin Bäumker and Wolfgang Dittrich. Parallel Algorithms for Image Processing: Practical Algorithms with Experiments. In 10th International Parallel Processing Symposium (IPPS '96), pages 429-433, April 1996. Keyword(s): Mesh graph, Connected components, BSP.


  10. Steven S. Lumetta, Arvind Krishnamurthy, and David E. Culler. Towards modeling the performance of a fast connected components algorithm on parallel machines. In Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM), pages 32-49, 1995. ACM Press. ISBN: 0-89791-816-9. [PDF] Keyword(s): Mesh graph, Connected components.


  11. John Greiner. A comparison of parallel algorithms for connected components. In Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures, pages 16-25, 1994. ACM Press. ISBN: 0-89791-671-9. [PDF] Keyword(s): Connected components, PRAM.


Internal reports
  1. D.A. Bader, G. Cong, and J. Feo. A comparison of the performance of list ranking and connected components algorithms on SMP and MTA shared-memory systems. Technical report, October 2004.


  2. Isabelle Guérin Lassous, Jens Gustedt, and Michel Morvan. Feasability, Portability, Predictability and Efficiency : Four Ambitious Goals for the Design and Implementation of Parallel Coarse Grained Graph Algorithms. Technical report 3885, INRIA, February 2000. [PDF] Keyword(s): Interval graphs, Sorting, Connected components, Maximum Weighted Clique, CGM.



BACK TO INDEX




Disclaimer:

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.




Last modified: Fri Aug 24 15:59:36 2012
Author: ngedmond.


This document was translated from BibTEX by bibtex2html