A distributed large graph coloring algorithm on Giraph

Abstract

Vertex graph coloring (VGC) is a well known problem in graph theory and has a large number of applications in various domains such as telecommunications, bioinformatics, and Internet. It is one of the 21 NP-complete problems of Karp. Several large graph treatment frameworks have emerged and are effective options to deal with the VGC problem. Examples of those frameworks include Pregel, Graphx and Giraph. The latter is one of the most popular large graph processing frameworks both in industry and academia. In this paper, we present a novel graph coloring algorithm designed for utilizing the simple parallelization technique provided by the Giraph framework or any other vertex-centric paradigm. We have compared our algorithm to existing Giraph graph coloring algorithms with regard to solution quality (number of used colors) and CPU runtime, using several large graph datasets. The obtained results have shown that the proposed algorithm is much more efficient than existing Giraph algorithms.