David G. Harris
ABSTRACT
The (∆+1)-coloring problem is a fundamental symmetry breaking problem in distributed computing. We give a new randomized coloring algorithm for (∆+1)-coloring running in O(√log ∆)+ 2^O(√log log n) rounds with probability 1-1/n^Ω(1) in a graph with n nodes and maximum degree ∆. This implies that the (∆+1)-coloring problem is easier than the maximal independent set problem and the maximal matching problem, due to their lower bounds by Kuhn, Moscibroda, and Wattenhofer [PODC'04]. Our algorithm also extends to the list-coloring problem where the palette of each node contains ∆+1 colors.
- N. Alon, L. Babai, and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms, 7(4):567–583, 1986. Google Scholar
Digital Library
- B. Awerbuch, A. V. Goldberg, M. Luby, and S. A. Plotkin. Network decomposition and locality in distributed computation. In Symp. on Foundations of Computer Science (FOCS), 1989. Google ScholarDigital Library
- R. Bar-Yehuda, K. Censor-Hillel, and G. Schwartzman. A distributed (2 + )-approximation for vertex cover in O(log ∆/ log log ∆) rounds. arXiv preprint arXiv:1602.03713, 2016.Google Scholar
- L. Barenboim. Deterministic (∆ + 1)-coloring in sublinear (in ∆) time in static, dynamic and faulty networks. In Symp. on Principles of Distributed Computing(PODC), pages 345–354, 2015. Google ScholarDigital Library
- L. Barenboim and M. Elkin. Deterministic distributed vertex coloring in polylogarithmic time. J. ACM, 58(5):23, 2011. Google ScholarDigital Library
- L. Barenboim and M. Elkin. Distributed graph coloring: Fundamentals and recent developments. Synthesis Lectures on Distributed Computing Theory, 4(1):1–171, 2013. Google ScholarCross Ref
- L. Barenboim, M. Elkin, and C. Gavoille. A fast network-decomposition algorithm and its applications to constant-time distributed computation. CoRR, abs/1505.05697, 2015.Google Scholar
- L. Barenboim, M. Elkin, and F. Kuhn. Distributed (∆ + 1)-coloring in linear (in ∆) time. SIAM Journal on Computing, 43(1):72–95, 2014.Google ScholarCross Ref
- L. Barenboim, M. Elkin, S. Pettie, and J. Schneider. The locality of distributed symmetry breaking. In Symp. on Foundations of Computer Science (FOCS), pages 321–330. IEEE, 2012. Google ScholarDigital Library
- K.-M. Chung, S. Pettie, and H.-H. Su. Distributed algorithms for Lovász local lemma and graph coloring. In Proc. 33rd ACM Symposium on Principles of Distributed Computing (PODC), pages 134–143, 2014. Google ScholarDigital Library
- D. Dubhashi, D. A. Grable, and A. Panconesi. Near-optimal, distributed edge colouring via the nibble method. Theor. Comput. Sci., 203(2):225–251, Aug. 1998. Google ScholarDigital Library
- M. Elkin, S. Pettie, and H.-H. Su. (2∆ − 1)-edge-coloring is much easier than maximal matching in the distributed setting. In Symp. on Discrete Algorithms (SODA), pages 355–370. SIAM, 2015. Google ScholarDigital Library
- P. Fraigniaud, M. Heinrich, and A. Kosowski. Local conflict coloring. arXiv preprint arXiv:1511.01287, 2015.Google Scholar
- B. Gfeller and E. Vicari. A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs. In Symp. on Principles of Distributed Computing, 2007. Google ScholarDigital Library
- M. Ghaffari. An improved distributed algorithm for maximal independent set. In Proc. 27th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2016. to appear. Google ScholarDigital Library
- A. V. Goldberg and S. A. Plotkin. Parallel (∆ + 1)-coloring of constant-degree graphs. Information Processing Letters, 25(4):241 – 245, 1987. Google ScholarDigital Library
- A. V. Goldberg, S. A. Plotkin, and G. E. Shannon. Parallel symmetry-breaking in sparse graphs. SIAM J. Discrete Math., 1(4):434–446, 1988. Google ScholarDigital Library
- M. Göös, J. Hirvonen, and J. Suomela. Linear-in-∆ lower bounds in the local model. In Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing(PODC), pages 86–95, 2014. Google ScholarDigital Library
- D. A. Grable and A. Panconesi. Nearly optimal distributed edge coloring in O(log log n) rounds. Random Structures & Algorithms, 10(3):385–405, 1997. Google ScholarDigital Library
- D. A. Grable and A. Panconesi. Fast distributed algorithms for Brooks–Vizing colorings. Journal of Algorithms, 37(1):85 – 120, 2000. Google ScholarDigital Library
- J. Hirvonen and J. Suomela. Distributed maximal matching: Greedy is optimal. In Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing(PODC), pages 165–174, 2012. Google ScholarDigital Library
- Ö. Johansson. Simple distributed ∆ + 1-coloring of graphs. Inf. Process. Lett., 70, 1999. Google ScholarDigital Library
- K. Kothapalli, C. Scheideler, M. Onus, and C. Schindelhauer. Distributed coloring in ˜ O( √ log n) bit rounds. In Proc. 20th International Parallel and Distributed Processing Symposium (IPDPS), 2006. Google ScholarDigital Library
- F. Kuhn, T. Moscibroda, and R. Wattenhofer. What cannot be computed locally! In Symp. on Principles of Distributed Computing (PODC), 2005. Google ScholarDigital Library
- F. Kuhn, T. Moscibroda, and R. Wattenhofer. Local computation: Lower and upper bounds. arXiv preprint arXiv:1011.5470, 2010.Google Scholar
- F. Kuhn and R. Wattenhofer. On the complexity of distributed graph coloring. In Symp. on Principles of Distributed Computing (PODC), 2006. Google ScholarDigital Library
- N. Linial. Locality in Distributed Graph Algorithms. SIAM Journal on Computing, 21(1):193–201, 1992. Google ScholarDigital Library
- N. Linial and M. Saks. Low diameter graph decompositions. Combinatorica, 13(4):441–454, 1993.Google ScholarCross Ref
- M. Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM Journal on Computing, 15:1036–1053, 1986. Google ScholarDigital Library
- M. Molloy and B. Reed. A bound on the total chromatic number. Combinatorica, 18(2):241–280, 1998.Google ScholarCross Ref
- M. Molloy and B. Reed. Graph Colouring and the Probabilistic Method. Algorithms and Combinatorics. Springer, 2001.Google Scholar
- M. Molloy and B. Reed. Asymptotically optimal frugal colouring. J. Comb. Theory, Ser. B, 100(2):226–246, 2010. Google ScholarDigital Library
- M. Molloy and B. Reed. Colouring graphs when the number of colours is almost the maximum degree. Journal of Combinatorial Theory, Series B, 109:134 – 195, 2014. Google ScholarDigital Library
- A. Panconesi and A. Srinivasan. Improved distributed algorithms for coloring and network decomposition problems. In Symp. on Theory of computing (STOC), 1992. Google ScholarDigital Library
- A. Panconesi and A. Srinivasan. Randomized distributed edge coloring via an extension of the Chernoff–Hoeffding bounds. SIAM Journal on Computing, 26(2):350–368, 1997. Google ScholarDigital Library
- S. Pettie and H.-H. Su. Distributed coloring algorithms for triangle-free graphs. Information and Computation, 243(0):263 – 280, 2015. Preliminary version appeared in 40th Intl. Colloq. on Automata, Languages and Programming (ICALP), pages 681–693, 2013. Google ScholarDigital Library
- B. Reed. ω, ∆, and χ. Journal of Graph Theory, 27(4):177–212, 1998. Google ScholarDigital Library
- B. Reed. A strengthening of brooks’ theorem. Journal of Combinatorial Theory, Series B, 76(2):136 – 149, 1999. Google ScholarDigital Library
- J. Schneider, M. Elkin, and R. Wattenhofer. Symmetry breaking depending on the chromatic number or the neighborhood growth. Theoretical Computer Science, 509:40–50, 2013. Google ScholarDigital Library
- J. Schneider and R. Wattenhofer. A log-star distributed maximal independent set algorithm for growth-bounded graphs. In Symp. on Principles of Distributed Computing(PODC), 2008. Google ScholarDigital Library
- J. Schneider and R. Wattenhofer. A new technique for distributed symmetry breaking. In Symp. on Principles of Distributed Computing(PODC), 2010. Google ScholarDigital Library
- M. Szegedy and S. Vishwanathan. Locality based graph coloring. In Proc. 25th ACM Symposium on Theory of Computing (STOC), pages 201–207, 1993. Google ScholarDigital Library
Index Terms
- Distributed (∆+1)-coloring in sublogarithmic rounds
Recommendations
An optimal distributed (Δ+1)-coloring algorithm?
STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of ComputingVertex coloring is one of the classic symmetry breaking problems studied in distributed computing. In this paper we present a new algorithm for (Δ+1)-list coloring in the randomized LOCAL model running in O(log∗n + Detd(poly logn)) time, where Detd(n′) ...
On the complexity of distributed graph coloring
PODC '06: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computingColoring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a distributed setting. Processors of a distributed system are nodes of an ...
Distributed graph coloring in a few rounds
PODC '11: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computingThis paper considers the question of how many colors a distributed graph coloring algorithm would need to use if it had only k rounds available, for any positive integer k. In our main result, we present an algorithm that runs in O(k) rounds for any k ...
Comments