Graph Coloring on a Coarse Grained Multiprocessor
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.
INRIA.HAL.SCIENCE Web Portal Publications, softwares... of Inria fellow Academics |
Jens Gustedt : Connect in order to contact the contributor
https://inria.hal.science/inria-00099384
Submitted on : Tuesday, September 26, 2006-8:53:35 AM
Last modification on : Friday, March 24, 2023-2:52:48 PM