Graph Coloring on a Coarse Grained Multiprocessor

Assefaw Hadish Gebremedhin Isabelle Guérin Lassous 1 Jens Gustedt 2 Jan Arne Telle
1 HIPERCOM - High performance communication
Inria Paris-Rocquencourt, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR
2 RESEDAS - Software Tools for Telecommunications and Distributed Systems
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We present the first efficient parallel algorithm for a coarse grained multiprocessor that colors a graph with a guarantee of at most Delta_G +1 colors.
Type de document :
Communication dans un congrès
U. Brandes & D.Wagner. 26th International Workshop on Graph-Theoretic Concepts in Computer Science - WG'2000, 2000, Konstanz, Germany, Springer-Verlag, 1928, pp.184-195, 2000, Lecture Notes in Computer Science
Liste complète des métadonnées

https://hal.inria.fr/inria-00099384
Contributeur : Jens Gustedt <>
Soumis le : mardi 26 septembre 2006 - 08:53:35
Dernière modification le : vendredi 25 mai 2018 - 12:02:06

Identifiants

  • HAL Id : inria-00099384, version 1

Collections

Citation

Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle. Graph Coloring on a Coarse Grained Multiprocessor. U. Brandes & D.Wagner. 26th International Workshop on Graph-Theoretic Concepts in Computer Science - WG'2000, 2000, Konstanz, Germany, Springer-Verlag, 1928, pp.184-195, 2000, Lecture Notes in Computer Science. 〈inria-00099384〉

Partager

Métriques

Consultations de la notice

157