Skip to Main content Skip to Navigation
Journal articles

Graph Coloring on a Coarse Grained Multicomputers

Assefaw Hadish Gebremedhin Isabelle Guérin Lassous 1 Jens Gustedt 2 Jan Arne Telle
1 ARES - Architectures of networks of services
Inria Grenoble - Rhône-Alpes, CITI - CITI Centre of Innovation in Telecommunications and Integration of services
2 ALGORILLE - Algorithms for the Grid
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.
Keywords : coloriage de graphes parallel algorithms graph coloring algorithmes parallèles
Document type :
Journal articles
Complete list of metadata
https://hal.inria.fr/inria-00099526
Contributor : Jens Gustedt <>
Submitted on : Tuesday, September 26, 2006 - 9:38:20 AM
Last modification on : Friday, February 26, 2021 - 3:28:02 PM

Identifiers

  • HAL Id : inria-00099526, version 1

Collections

INRIA | CNRS | INSA-LYON | LORIA | UNIV-LORRAINE | CITI | INSA-GROUPE | UDL

Citation

Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle. Graph Coloring on a Coarse Grained Multicomputers. Discrete Applied Mathematics, Elsevier, 2003, 131 (1), pp.179-198. ⟨inria-00099526⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

225

 

Contact                    Legal Notice                    Personal Data