Results 1 
2 of
2
Graph Coloring on Coarse Grained Multicomputers
, 2002
"... 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 pprocessor CGM model the proposed al ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
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 pprocessor 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 worstcase for the deterministic variant. Key words: graph algorithms, parallel algorithms, graph coloring, Coarse Grained Multicomputers 1
Abstract Graph Coloring on Coarse Grained
"... 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 pprocessor CGM model the proposed ..."
Abstract
 Add to MetaCart
(Show Context)
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 pprocessor 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.