Abstract : We present the first efficient algorithm for a coarse grained multiprocessor that colors a graph $G$ with a guarantee of at most $\D +1$ colors.
https://hal.inria.fr/inria-00072747
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 10:47:31 AM Last modification on : Friday, February 26, 2021 - 3:28:07 PM Long-term archiving on: : Sunday, April 4, 2010 - 11:20:50 PM