Highly Influenced

5 Excerpts

@article{Gebremedhin2003GraphCO, title={Graph coloring on coarse grained multicomputers}, author={Assefaw Hadish Gebremedhin and Isabelle Gu{\'e}rin Lassous and Jens Gustedt and Jan Arne Telle}, journal={Discrete Applied Mathematics}, year={2003}, volume={131}, pages={179-198} }

- Published in Discrete Applied Mathematics 2003
DOI:10.1016/S0166-218X(02)00424-9

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: a randomized and a 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… CONTINUE READING