Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Distributed Delta-Coloring under Bandwidth Limitations (2405.09975v1)

Published 16 May 2024 in cs.DS and cs.DC

Abstract: We consider the problem of coloring graphs of maximum degree $\Delta$ with $\Delta$ colors in the distributed setting with limited bandwidth. Specifically, we give a $\mathsf{poly}\log\log n$-round randomized algorithm in the CONGEST model. This is close to the lower bound of $\Omega(\log \log n)$ rounds from [Brandt et al., STOC '16], which holds also in the more powerful LOCAL model. The core of our algorithm is a reduction to several special instances of the constructive Lov\'asz local lemma (LLL) and the $deg+1$-list coloring problem.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (43)
  1. Brooks’ theorem in graph streams: a single-pass semi-streaming algorithm for ΔΔ\Deltaroman_Δ-coloring. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pages 234–247, 2022.
  2. L. Barenboim. Deterministic (ΔΔ\Deltaroman_Δ + 1)-coloring in sublinear (in ΔΔ\Deltaroman_Δ) time in static, dynamic and faulty networks. In Proc. 34th ACM Symposium on Principles of Distributed Computing (PODC), pages 345–354, 2015.
  3. Distributed ΔΔ{\Delta}roman_Δ-coloring plays hide-and-seek. In Proc. 54th ACM Symp. on Theory of Computing (STOC), 2022.
  4. Locally checkable labelings with small messages. In Seth Gilbert, editor, 35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference), volume 209 of LIPIcs, pages 8:1–8:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
  5. Distributed Graph Coloring: Fundamentals and Recent Developments. Morgan & Claypool Publishers, 2013.
  6. Distributed coloring of graphs with an optimal number of colors. volume 126 of LIPIcs, pages 10:1–10:15. LZI, 2019.
  7. The locality of distributed symmetry breaking. Journal of the ACM, 63(3):20:1–20:45, 2016.
  8. A lower bound for the distributed Lovász local lemma. In Proc. 48th ACM Symposium on Theory of Computing (STOC 2016), pages 479–488. ACM, 2016.
  9. Efficient deterministic distributed coloring with small bandwidth. In PODC ’20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020, pages 243–252, 2020.
  10. R. Leonard Brooks. On colouring the nodes of a network. Mathematical Proceedings of the Cambridge Philosophical Society, 37(2):194–197, 1941.
  11. Parallel derandomization for coloring, 2024. Note: https://arxiv.org/abs/2302.04378v1 contains the Delta-coloring algorithm.
  12. Distributed edge coloring and a special case of the constructive Lovász local lemma. ACM Trans. Algorithms, 2020.
  13. An optimal distributed (ΔΔ\Deltaroman_Δ+1)-coloring algorithm? In Proceedings of the ACM Symposium on Theory of Computing (STOC), pages 445–456, 2018.
  14. Optimal distributed coloring algorithms for planar graphs in the LOCAL model. In Timothy M. Chan, editor, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pages 787–804. SIAM, 2019.
  15. A time hierarchy theorem for the LOCAL model. SIAM J. Comput., 48(1):33–69, 2019.
  16. Distributed algorithms for the Lovász local lemma and graph coloring. Distributed Comput., 30(4):261–280, 2017.
  17. Peter Davies. Improved distributed algorithms for the Lovász local lemma and edge coloring. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 4273–4295. SIAM, 2023.
  18. Problems and Results on 3-chromatic Hypergraphs and some Related Questions. Colloquia Mathematica Societatis János Bolyai, pages 609–627, 1974.
  19. (2Δ−1Δ1\Delta-1roman_Δ - 1)-edge-coloring is much easier than maximal matching in the distributed setting. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pages 355–370, 2015.
  20. Sublogarithmic Distributed Algorithms for Lovász Local Lemma, and the Complexity Hierarchy. In the Proceedings of the 31st International Symposium on Distributed Computing (DISC), pages 18:1–18:16, 2017.
  21. Local conflict coloring. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pages 625–634, 2016.
  22. Fast distributed Brooks’ theorem. In Proceedings of the SIAM-ACM Symposium on Discrete Algorithms (SODA), pages 2567–2588, 2023.
  23. Manuela Fischer. Improved deterministic distributed matching via rounding. In Andréa W. Richa, editor, 31st International Symposium on Distributed Computing, DISC 2017, October 16-20, 2017, Vienna, Austria, volume 91 of LIPIcs, pages 17:1–17:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
  24. List defective colorings: Distributed algorithms and applications. In Rotem Oshman, editor, 37th International Symposium on Distributed Computing, DISC 2023, October 10-12, 2023, L’Aquila, Italy, volume 281 of LIPIcs, pages 22:1–22:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
  25. Mohsen Ghaffari. Distributed maximal independent set using small messages. In Proc. 30th Symp. on Discrete Algorithms (SODA), pages 805–820, 2019.
  26. On derandomizing local distributed algorithms. In 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pages 662–673, 2018.
  27. Improved distributed delta-coloring. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, July 23-27, 2018, pages 427–436, 2018.
  28. Deterministic distributed vertex coloring: Simpler, faster, and without network decomposition. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), pages 1009–1020, 2021.
  29. Efficient randomized distributed coloring in CONGEST. In Proceedings of the ACM Symposium on Theory of Computing (STOC), pages 1180–1193, 2021. Full version at CoRR abs/2105.04700.
  30. Near-optimal distributed degree+1 coloring. In Stefano Leonardi and Anupam Gupta, editors, STOC ’22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022, pages 450–463. ACM, 2022.
  31. Fast distributed vertex splitting with applications. In Christian Scheideler, editor, 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA, volume 246 of LIPIcs, pages 26:1–26:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
  32. Distributed Lovász local lemma under bandwidth limitations, 2024.
  33. Superfast coloring in CONGEST via efficient color sampling. In Tomasz Jurdzinski and Stefan Schmid, editors, Structural Information and Communication Complexity - 28th International Colloquium, SIROCCO 2021, Wrocław, Poland, June 28 - July 1, 2021, Proceedings, volume 12810 of Lecture Notes in Computer Science, pages 68–83. Springer, 2021.
  34. Overcoming congestion in distributed coloring. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pages 26–36. ACM, 2022.
  35. Distributed (Δ+1Δ1\Delta+1roman_Δ + 1)-coloring in sublogarithmic rounds. Journal of the ACM, 65:19:1–19:21, 2018.
  36. Öjvind Johansson. Simple distributed Δ+1Δ1\Delta+1roman_Δ + 1-coloring of graphs. Inf. Process. Lett., 70(5):229–232, 1999.
  37. Nati Linial. Locality in distributed graph algorithms. SIAM Journal on Computing, 21(1):193–201, 1992.
  38. Distributed symmetry breaking on power graphs via sparsification. In Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, PODC ’23, page 157–167, New York, NY, USA, 2023. Association for Computing Machinery.
  39. Local conflict coloring revisited: Linial for lists. In Hagit Attiya, editor, 34th International Symposium on Distributed Computing, DISC 2020, October 12-16, 2020, Virtual Conference, volume 179 of LIPIcs, pages 16:1–16:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
  40. Efficient CONGEST algorithms for the Lovász local lemma. In Seth Gilbert, editor, Proceedings of the International Symposium on Distributed Computing (DISC), volume 209 of LIPIcs, pages 31:1–31:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
  41. Luke Postle. Linear-time and efficient distributed algorithms for list coloring graphs on surfaces. In David Zuckerman, editor, 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019, pages 929–941. IEEE Computer Society, 2019.
  42. The local nature of ΔΔ\Deltaroman_Δ-coloring and its algorithmic applications. Combinatorica, 15(2):255–280, 1995.
  43. Polylogarithmic-time deterministic network decomposition and distributed derandomization. In Proceedings of the ACM Symposium on Theory of Computing (STOC), pages 350–363, 2020.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Yannic Maus (45 papers)
  2. Magnús M. Halldórsson (26 papers)

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets