The Complexity of Distributed Edge Coloring with Small Palettes

The complexity of distributed edge coloring depends heavily on the palette size as a function of the maximum degree Delta. In this paper we explore the complexity of edge coloring in the LOCAL model in different palette size regimes. Our results are as follows. We simplify the round elimination technique of Brandt et al. [9] and prove that (2 Delta-2)-edge coloring requires Omega(log(Delta) log n) time w.h.p. and Omega(log(Delta) n) time deterministically, even on trees. The simplified technique is based on two ideas: the notion of an irregular running time (in which network components terminate the algorithm at prescribed, but irregular times) and some general observations that transform weak lower bounds into stronger ones. We give a randomized edge coloring algorithm that can use palette sizes as small as Delta + (O) over tilde(root Delta), which is a natural barrier for randomized approaches. The running time of the algorithm is at most O(log Delta . T-LLL), where T-LLL is the complexity of a permissive version of the constructive Lovasz local lemma We develop a new distributed Lovasz local lemma algorithm for tree-structured dependency graphs, which leads to a (1 + epsilon)-edge coloring algorithm for trees running in O(log log n) time. This algorithm arises from two new results: a deterministic O(log n)-time LLL algorithm for tree-structured instances, and a randomized O(log log n)-time graph shattering method for breaking the dependency graph into independent O(log n)-size LLL instances. A natural approach to computing (Delta + 1)-edge colorings (Vizing's theorem) is to extend partial colorings by iteratively re-coloring parts of the graph, e.g., via "augmenting paths. We prove that this approach may be viable, but in the worst case requires recoloring sub graphs of diameter Omega(Delta log n). This stands in contrast to distributed algorithms for Brooks' theorem [32], which exploit the existence of O(log(Delta) n)-length augmenting paths.