On greedy graph coloring in the distributed model

Authors:
Adrian Kosowski;Łukasz Kuszner
Affiliations:
Department of Algorithms and System Modeling, Gdańsk University of Technology, Poland;Department of Algorithms and System Modeling, Gdańsk University of Technology, Poland
Venue:
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Year:
2006

Citing 13
Cited 1

A simple parallel algorithm for the maximal independent set problem

SIAM Journal on Computing
Algorithms for some graph problems on a distributed computational model

Information Sciences: an International Journal
Almost all k-colorable graphs are easy to color

Journal of Algorithms
Welsh-Powell opposition graphs

Information Processing Letters
Improved distributed algorithms for coloring and network decomposition problems

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Locality in distributed graph algorithms

SIAM Journal on Computing
Free Bits, PCPs, and Nonapproximability---Towards Tight Results

SIAM Journal on Computing
Assigning codes in wireless networks: bounds and scaling properties

Wireless Networks
Simple distributed&Dgr; + 1-coloring of graphs

Information Processing Letters
Fast distributed algorithms for Brooks-Vizing colorings

Journal of Algorithms
Fast distributed graph coloring with O(&Dgr;) colors

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A Better Practical Algorithm for Distributed Graph Coloring

PARELEC '02 Proceedings of the International Conference on Parallel Computing in Electrical Engineering
Some simple distributed algorithms for sparse networks

Distributed Computing

On the complexity of distributed greedy coloring

DISC'07 Proceedings of the 21st international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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(ΔlognlogΔ) 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.