Graph Coloring on Coarse Grained Multicomputers

Graph Coloring on Coarse Grained Multicomputers (2002)

by Assefaw Hadish Gebremedhin , Isabelle Guerin Lassous , Jens Gustedt , Jan Arne Telle

Citations:

6 - 1 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Graph Coloring on Coarse Grained Multicomputers	user correction - Legacy Corrections
AUTHOR NAME	Assefaw Hadish Gebremedhin	user correction - Legacy Corrections
AUTHOR AFFIL	a	user correction - Legacy Corrections
AUTHOR NAME	Isabelle Guerin Lassous	user correction - Legacy Corrections
AUTHOR AFFIL	b	user correction - Legacy Corrections
AUTHOR NAME	Jens Gustedt	user correction - Legacy Corrections
AUTHOR AFFIL	c	user correction - Legacy Corrections
AUTHOR NAME	Jan Arne Telle	user correction - Legacy Corrections
AUTHOR AFFIL	; a; Univ. of Bergen, Norway.; b; c; d	user correction - Legacy Corrections
AUTHOR ADDR	; INRIA Rocquencourt, France.; LORIA & INRIA Lorraine, France.; Univ. of Bergen, Norway.	user correction - Legacy Corrections
ABSTRACT	We present an efficient and scalable Coarse Grained Multicomputer (CGM) coloring algorithm that colors a graph G with at most D+ 1 colors where D 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. Key words: graph algorithms, parallel algorithms, graph coloring, Coarse Grained Multicomputers 1	user correction - Legacy Corrections
YEAR	2002	user correction - Legacy Corrections
CITATIONS	25 found	ParsCit 1.0