Deterministic parallel graph coloring with hashing
Per Normann, Johan Öfverstedt · 2015
Abstract In this paper we propose a new deterministic parallel graph coloring algo-rithm. Parallelism is achieved by distribution of vertices to processors by hashing. The hashing is based on markers assigned to each conflict prone vertex. 1