In the paper we consider distributed algorithms for greedy graph coloring. For the largest-first (LF) approach, we propose a new distributed algorithm which is shown to color a graph in an expected time of O(Δ log n log Δ) rounds, and we prove that any distributed LF-coloring algorithm requires at least Ω(Δ) rounds. We discuss the quality of obtained colorings in the general case and for particular graph classes. Finally, we show that other greedy graph coloring approaches, such as smallest-last (SL) or dynamic-saturation (SLF), are not suitable for application in distributed computing, requiring Ω(n) rounds. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Kosowski, A., & Kuszner, L. (2006). On greedy graph coloring in the distributed model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4128 LNCS, pp. 592–601). Springer Verlag. https://doi.org/10.1007/11823285_61
Mendeley helps you to discover research relevant for your work.