Abstract
We perform an extensive experimental evaluation of very simple, distributed, randomized algorithms for (Δ + 1) and so-called Brooks–Vizing vertex colorings, i.e., colorings using considerably fewer than Δ colors (here Δ denotes the maximum degree of the graph). We consider variants of algorithms known from the literature, boosting them with a distributed independent set computation. Our study clearly determines the relative performance of the algorithms with respect to the number of communication rounds and the number of colors. The results are confirmed by all the experiments and instance families. The empirical evidence shows that some algorithms use very few rounds and are rather effective, thus being amenable to be used in practice.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Finocchi, I., Panconesi, A. & Silvestri, R. An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms. Algorithmica 41, 1–23 (2005). https://doi.org/10.1007/s00453-004-1104-3
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-004-1104-3