Evaluation of Serial and Parallel Shared-Memory Distance-1 Graph Coloring Algorithms

  • Lukas GnamEmail author
  • Siegfried Selberherr
  • Josef Weinbub
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11189)


Within the scope of computational science and engineering, the standard graph coloring problem, the distance-1 coloring, is typically used to select independent sets on which subsequent parallel computations can be guaranteed. As graph coloring is an active field of research, various algorithms are available, each offering advantages and disadvantages. We compare several serial as well as parallel shared-memory graph coloring algorithms for the standard graph coloring problem based on reference graphs. Our investigation covers well established as well as recent algorithms and their support for balanced and unbalanced approaches. An overview on speedup, used number of colors, and their respective population for different test graphs is provided. It is shown that the parallel approaches produce similar results as the serial methods, but for specific cases the serial algorithms still remain a good option, when certain properties (e.g., balancing) are of major importance.


Graph coloring Shared-memory Distance-1 coloring Parallel algorithm 



The financial support by the Austrian Federal Ministry for Digital and Economic Affairs and the National Foundation for Research, Technology and Development is gratefully acknowledged. The computational results presented have been achieved using the Vienna Scientific Cluster (VSC).


  1. 1.
    Çatalyürek, Ü.V., Feo, J., Gebremedhin, A.H., Halappanavar, M., Pothen, A.: Graph coloring algorithms for multi-core and massively multithreaded architectures. Parallel Comput. 38(10), 576–594 (2012)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1:1–1:25 (2011)MathSciNetzbMATHGoogle Scholar
  3. 3.
    Diestel, R.: Graph Theory, 5th edn. Springer, Heidelberg (2017)CrossRefGoogle Scholar
  4. 4.
    Gebremedhin, A.H., Manne, F.: Scalable parallel graph coloring algorithms. Concurr. Pract. Exp. 12(12), 1131–1146 (2000)CrossRefGoogle Scholar
  5. 5.
    Gyárfás, A., Lehel, J.: On-line and first fit colorings of graphs. J. Graph Theory 12(2), 217–227 (1988)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Hawick, K., Leist, A., Playne, D.: Parallel graph component labelling with GPUs and CUDA. Parallel Comput. 36(12), 655–678 (2010)CrossRefGoogle Scholar
  7. 7.
    Ibanez, D., Shephard, M.: Mesh adaptation for moving objects on shared memory hardware. In: Proceedings of the International Meshing Roundtable (2016)Google Scholar
  8. 8.
    Khorasani, F., Gupta, R., Bhuyan, L.N.: Scalable SIMD-efficient graph processing on GPUs. In: Proceedings of the International Conference on Parallel Computing Technologies, pp. 39–50 (2015)Google Scholar
  9. 9.
    Lu, H., Halappanavar, M., Chavarría-Miranda, D., Gebremedhin, A.H., Panyala, A., Kalyanaraman, A.: Algorithms for balanced graph colorings with applications in parallel computing. IEEE Trans. Parallel Distrib. Syst. 28(5), 1240–1256 (2017)CrossRefGoogle Scholar
  10. 10.
    Manne, F.: A parallel algorithm for computing the extremal eigenvalues of very large sparse matrices. In: Kågström, B., Dongarra, J., Elmroth, E., Waśniewski, J. (eds.) PARA 1998. LNCS, vol. 1541, pp. 332–336. Springer, Heidelberg (1998). Scholar
  11. 11.
    Manne, F., Boman, E.: Balanced Greedy colorings of sparse random graphs. In: Proceedings of the Norwegian Informatics Conference, pp. 113–124 (2005)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Lukas Gnam
    • 1
    Email author
  • Siegfried Selberherr
    • 2
  • Josef Weinbub
    • 1
  1. 1.Christian Doppler Laboratory for High Performance TCAD, Institute for MicroelectronicsTU WienViennaAustria
  2. 2.Institute for MicroelectronicsTU WienViennaAustria

Personalised recommendations