A parallel MCMC algorithm for the Balanced Graph Coloring problem - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2019

A parallel MCMC algorithm for the Balanced Graph Coloring problem

Giuliano Grossi
  • Fonction : Auteur
  • PersonId : 873004
Raffaella Lanzarotti
  • Fonction : Auteur
  • PersonId : 1054037
Alessandro Petrini
  • Fonction : Auteur
  • PersonId : 1054038

Résumé

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.
Fichier principal
Vignette du fichier
2019GbRColoring.pdf (383.85 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02285800 , version 1 (13-09-2019)

Identifiants

Citer

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⟩
133 Consultations
359 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More