Distributed Soft Path Coloring

Authors:
Peter Damaschke
Affiliations:
-
Venue:
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Year:
2003

Citing 14
Cited 1

Deterministic coin tossing with applications to optimal parallel list ranking

Information and Control
Parallel symmetry-breaking in sparse graphs

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Locality in distributed graph algorithms

SIAM Journal on Computing
Randomized algorithms

Randomized algorithms
What Can Be Computed Locally?

SIAM Journal on Computing
Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds

SIAM Journal on Computing
Fault-local distributed mending

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

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Distributed long-lived list colouring: how to dynamically allocate frequencies in cellular networks

Wireless Networks
Tight Fault Locality

SIAM Journal on Computing
The Evolution of Customer Middleware Requirements

PDIS '94 Proceedings of the Third International Conference on Parallel and Distributed Information Systems
Approximation Algorithms for Channel Assignment with Constraints

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Local computations on static and dynamic graphs

ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Network decomposition and locality in distributed computation

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science

Soft Edge Coloring

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a soft coloring of a graph, a few adjacent vertices may 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. We propose a randomized algorithm for 2-coloring the path with optimal decrease rate. Conflicts can be reduced exponentially faster if extra colors are allowed. We generalize the results to a broader class of locally checkable labeling problems on enhanced paths. A single result for grid coloring is also presented.