Publications about 'CGM'
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. E.N. Cáceres, S.W. Song, and J.L. Szwarcfiter. A Parallel Unrestricted Depth Search Algorithm. In Proc. 2001 International Conference on Parallel and Distributed Processing Techniques and Applications, Vol. 1, pages 521-526, June 2001. [PDF] Keyword(s): Unrestricted depth search, CGM, BSP.

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

  5. Frank Dehne, Andreas Fabri, and Andrew Rau-Chaplin. Scalable parallel geometric algorithms for coarse grained multicomputers. In Proceedings of the Ninth Annual Symposium on Computational Geometry, pages 298-307, 1993. ACM Press. ISBN: 0-89791-582-8. [PDF] Keyword(s): CGM.

Internal reports
  1. 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.

  1. Albert Chan and Frank Dehne. cgmLIB: A Library For Coarse-Grained Parallel Computing. Note: \texttt, 2004 December. Keyword(s): CGMgraph.



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