Skip to Main content Skip to Navigation
Book sections

A parallel MCMC algorithm for the Balanced Graph Coloring problem

Abstract : In parallel computation domain, graph coloring is widely studied in its own and represents a reference problem for scheduling of parallel tasks. Unfortunately, common graph coloring strategies usually focus on minimizing the number of colors without any concern for the sizes of each color class, thus producing highly skewed color class distributions. However, to guarantee efficiency in parallel computations, but also in other application contexts, it is important to keep the color classes highly balanced in their sizes. In this paper we address this challenging issue for large scale graphs, proposing a fast parallel MCMC heuristic for sparse graphs that randomly generates good balanced colorings provided that a sufficient number of colors are made available. We show its effectiveness through some numerical simulations on random graphs.
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download
Contributor : Donatello Conte <>
Submitted on : Friday, September 13, 2019 - 10:14:01 AM
Last modification on : Friday, October 18, 2019 - 11:12:20 AM
Document(s) archivé(s) le : Saturday, February 8, 2020 - 11:07:02 PM


Files produced by the author(s)



Donatello Conte, Giuliano Grossi, Raffaella Lanzarotti, Jianyi Lin, Alessandro Petrini. A parallel MCMC algorithm for the Balanced Graph Coloring problem. Graph-Based Representations in Pattern Recognition 12th IAPR-TC-15 International Workshop, GbRPR 2019, Tours, France, June 19–21, 2019, Proceedings, pp.161-171, 2019, Image Processing, Computer Vision, Pattern Recognition, and Graphics, ⟨10.1007/978-3-030-20081-7_16⟩. ⟨hal-02285800⟩



Record views


Files downloads