Distributed soft path coloring
Paper i proceeding, 2003

Soft coloring of a graph means that only a few adjacent vertices receive the same color. We study soft coloring in the distributed model where vertices are processing units and edges are communication links. We aim at reducing coloring conflicts as quickly as possible over time by recoloring. Basic insights can be obtained already on the simplest topology, a path. We propose a randomized algorithm for 2-coloring the path with optimal decrease of conflicts. Its analysis is based on properties of random strings of brackets. Conflicts can be reduced exponentially faster if extra colors are allowed. Thus we observe the existence of two significantly different types of the problem, with different ways to get rid of conflicts. Later we generalize the results to a broader class of locally checkable labeling problems on enhanced paths, namely labelings by states from a skew-symmetric transition graph. A result for grid coloring is also presented.

distributed algorithms

locality

randomized algorithms

graph coloring

Författare

Peter Damaschke

Chalmers, Institutionen för datavetenskap, Algoritmer

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 2607 523-534

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1007/3-540-36494-3_46

ISBN

3-540-00623-0