Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty NetworksDeterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks

Access Restriction
Subscribed

 Author Barenboim, Leonid Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©2016 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Subject Keyword Distributed algorithms ♦ Coloring ♦ Partitions ♦ Polynomials Abstract We study the distributed (Δ + 1)-vertex-coloring and (2Δ ™ 1)-edge-coloring problems. These problems are among the most important and intensively studied problems in distributed computing. Despite very intensive research in the last 30 years, no deterministic algorithms for these problems with sublinear (in Δ) time have been known so far. Moreover, for more restricted scenarios and some related problems there are lower bounds of Ω(Δ) [Göös et al. 2014; Hirvonen and Suomela 2012; Kuhn and Wattenhofer 2006; Szegedy and Vishwanathan 1993]. The question of the possibility to devise algorithms that overcome this challenging barrier is one of the most fundamental questions in distributed symmetry breaking [Barenboim and Elkin 2009, 2011; Göös et al. 2014; Hirvonen and Suomela 2012; Kuhn 2009; Panconesi and Rizzi 2001]. In this article, we settle this question for (Δ + 1)-vertex-coloring and (2Δ ™ 1)-edge-coloring by devising deterministic algorithms that require $O(Δ^{3/4}log$ Δ + $log^{*}n)$ time in the static, dynamic, and faulty settings. (The term $log^{*}n$ is unavoidable in view of the lower bound of Linial [1987].) Moreover, for (1 + $\textit{o}(1))Δ-vertex-coloring$ and (2 + $\textit{o}(1))Δ-edge-coloring$ we devise algorithms with Õ(&sqrt;Δ + $log^{*}$ $\textit{n})$ deterministic time. This is roughly a quadratic improvement comparing to the state-of-the-art that requires $\textit{O}(Δ$ + $log^{*}n)$ time [Barenboim and Elkin 2009; Kuhn 2009; Panconesi and Rizzi 2001]. Our results are actually more general than that since they apply also to a variant of the list-coloring problem that generalizes ordinary coloring. Our results are obtained using a novel technique for coloring partially colored graphs (also known as $\textit{fixing}).$ We partition the uncolored parts into a small number of subgraphs with certain helpful properties. Then we color these subgraphs gradually using a technique that employs constructions of polynomials in a novel way. Our construction is inspired by the algorithm of Linial [1987] for ordinary $O(Δ^{2})-coloring.$ However, it is a more sophisticated construction that differs from that of Linial [1987] in several important respects. These new insights in using systems of polynomials allow us to significantly speed up the $\textit{O}(Δ)-coloring$ algorithms. Moreover, they allow us to devise algorithms with the same running time also in the more complicated settings of dynamic and faulty networks. Description Author Affiliation: Open University of Israel, Raanana (Barenboim, Leonid) ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 2016-11-08 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 63 Issue Number 5 Page Count 22 Starting Page 1 Ending Page 22

Open content in new tab

Source: ACM Digital Library