Skip to Main content Skip to Navigation
Reports

Graph Coloring on a Coarse Grained Multiprocessor (extended abstract)

Assefaw Hadish Gebremedhin Isabelle Guérin Lassous Jens Gustedt 1 Jan Arne Telle
1 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 algorithm for a coarse grained multiprocessor that colors a graph $G$ with a guarantee of at most $\D +1$ colors.
keyword : graph coloring parallelism CGM
Document type :
Reports
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
https://hal.inria.fr/inria-00072747
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 10:47:31 AM
Last modification on : Friday, February 4, 2022 - 3:32:00 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:20:50 PM

Files

Vignette du document
RR-3906.pdf

Identifiers

  • HAL Id : inria-00072747, version 1

Collections

INRIA | INRIA-RRRT | CNRS | LARA | LORIA | UNIV-LORRAINE | INRIA2

Citation

Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle. Graph Coloring on a Coarse Grained Multiprocessor (extended abstract). [Research Report] RR-3906, INRIA. 2000, pp.11. ⟨inria-00072747⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

67

Files downloads

138

 

Contact                    Legal Notice                    Personal Data