Graph Coloring on a Coarse Grained Multiprocessor (extended abstract)
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.
Domains
Other [cs.OH]
Loading...