Uppsala University Department of Information Technology
In this paper we propose a new deterministic parallel graph coloring algorithm. Parallelism is achieved by distribution of vertices to processors by hashing. The hashing is based on markers assigned to each conflict prone vertex.
Available as PDF (278 kB, no cover)
Download BibTeX entry.