Graph Coloring on a Coarse Grained Multicomputers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Applied Mathematics Year : 2003

Graph Coloring on a Coarse Grained Multicomputers

Assefaw Hadish Gebremedhin
  • Function : Author
Jens Gustedt
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.
No file

Dates and versions

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

Identifiers

  • HAL Id : inria-00099526 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More