Deterministic Distributed (Δ plus o(Δ))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity

In the distributed message-passing setting a communication network is represented by a graph whose vertices represent processors that perform local computations and communicate over the edges of the graph. In the distributed edge-coloring problem the processors are required to assign colors to edges, such that all edges incident on the same vertex are assigned distinct colors. The previously-known deterministic algorithms for edge-coloring employed at least (2 Delta - 1) colors, even though any graph admits an edge-coloring with Delta + 1 colors [36]. Moreover, the previously-known deterministic algorithms that employed at most O(Delta) colors required superlogarithmic time [3, 6, 7, 17]. In the current paper we devise deterministic edge-coloring algorithms that employ only Delta + o(Delta) colors, for a very wide family of graphs. Specifically, as long as the arboricity a of the graph is a = O(Delta(1-epsilon)), for a constant epsilon > 0, our algorithm computes such a coloring within polylogarithmic deterministic time. We also devise significantly improved deterministic edge-coloring algorithms for general graphs for a very wide range of parameters. Specifically, for any value kappa in the range [4 Delta, 2o(log Delta). Delta], ou kappa-edge-coloring algorithm has smaller running time than the best previously-known kappa-edge-coloring algorithms. Our algorithms are actually much more general, since edge-coloring is equivalent to vertex-coloring of line graphs. Our method is applicable to vertex-coloring of the family of graphs with bounded diversity that contains line graphs, line graphs of hypergraphs, and many other graphs. We significantly improve upon previous vertex-coloring of such graphs, and as an implication also obtain the improved edge-coloring algorithms for general graphs. Our results are obtained using a novel technique that connects vertices or edges in a certain way that reduces clique size. The resulting structures, which we call connectors, can be colored more efficiently than the original graph. Moreover, the color classes constitute simpler subgraphs that can be colored even more efficiently using appropriate connectors. We introduce several types of connectors that are useful for various scenarios. We believe that this technique is of independent interest.