Graph Coloring on a Coarse Grained Multiprocessor - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2000

Graph Coloring on a Coarse Grained Multiprocessor

Assefaw Hadish Gebremedhin
  • Function : Author
Jan Arne Telle
  • Function : Author
  • PersonId : 889063

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

Dates and versions

inria-00099384 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00099384 , version 1

Cite

Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, Jan Arne Telle. Graph Coloring on a Coarse Grained Multiprocessor. 26th International Workshop on Graph-Theoretic Concepts in Computer Science - WG'2000, 2000, Konstanz, Germany, pp.184-195. ⟨inria-00099384⟩
58 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More