Graph coloring on coarse grained multicomputers

  • Authors:

  • Assefaw Hadish Gebremedhin;Isabelle Guérin Lassous;Jens Gustedt;Jan Arne Telle

  • Affiliations:

  • Department of Informatics, University of Bergen, 5020 Bergen, Norway;INRIA Rocquencourt, France;LORIA and INRIA Lorraine, France;Department of Informatics, University of Bergen, 5020 Bergen, Norway

  • Venue:
  • Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an efficient and scalable coarse grained multicomputer (CGM) coloring algorithm that colors a graph G with at most Δ + 1 colors where Δ is the maximum degree in G. This algorithm is given in two variants: randomized and deterministic. We show that on a p-processor CGM model the proposed algorithms require a parallel time of O(|G|/p) and a total work and overall communication cost of O(|G|). These bounds correspond to the average case for the randomized version and to the worst case for the deterministic variant.