Document Open Access Logo

Fast Coloring Despite Congested Relays

Authors Maxime Flin , Magnús M. Halldórsson , Alexandre Nolin

PDF
Thumbnail PDF

File

LIPIcs.DISC.2023.19.pdf
  • Filesize: 0.93 MB
  • 24 pages

Document Identifiers

Author Details

Maxime Flin
  • Reykjavik University, Iceland
Magnús M. Halldórsson
  • Reykjavik University, Iceland
Alexandre Nolin
  • CISPA Helmholtz Center for Information Security, Saarbrücken, Germany

Funding

  • Flin, Maxime: Funded by the Icelandic Research Fund (grant 2310015).
  • Halldórsson, Magnús M.: Partially supported by the Icelandic Research Fund (grant 217965).

Cite AsGet BibTex

Maxime Flin, Magnús M. Halldórsson, and Alexandre Nolin. Fast Coloring Despite Congested Relays. In 37th International Symposium on Distributed Computing (DISC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 281, pp. 19:1-19:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.DISC.2023.19

Abstract

We provide a O(log⁶ log n)-round randomized algorithm for distance-2 coloring in CONGEST with Δ²+1 colors. For Δ≫polylog n, this improves exponentially on the O(logΔ+polylog log n) algorithm of [Halldórsson, Kuhn, Maus, Nolin, DISC'20].

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
  • Mathematics of computing → Graph coloring
Keywords
  • CONGEST model
  • distributed graph coloring
  • power graphs

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Noga Alon and Sepehr Assadi. Palette sparsification beyond (Δ+1) vertex coloring. In APPROX/RANDOM, volume 176 of LIPIcs, pages 6:1-6:22. LZI, 2020. URL: https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.6.
  2. Noga Alon, László Babai, and Alon Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. of Algorithms, 7(4):567-583, 1986. URL: https://doi.org/10.1016/0196-6774(86)90019-2.
  3. Sepehr Assadi, Yu Chen, and Sanjeev Khanna. Sublinear algorithms for (Δ + 1) vertex coloring. In SODA, pages 767-786. SIAM, 2019. URL: https://doi.org/10.1137/1.9781611975482.48.
  4. Leonid Barenboim and Michael Elkin. Distributed Graph Coloring: Fundamentals and Recent Developments. Morgan & Claypool Publishers, 2013. URL: https://doi.org/10.2200/S00520ED1V01Y201307DCT011.
  5. Leonid Barenboim, Michael Elkin, and Uri Goldenberg. Locally-iterative distributed (Δ + 1)-coloring and applications. J. ACM, 69(1):5:1-5:26, 2022. URL: https://doi.org/10.1145/3486625.
  6. Leonid Barenboim, Michael Elkin, Seth Pettie, and Johannes Schneider. The locality of distributed symmetry breaking. Journal of the ACM, 63(3):20:1-20:45, 2016. URL: https://doi.org/10.1145/2903137.
  7. Leonid Barenboim and Uri Goldenberg. Speedup of distributed algorithms for power graphs in the CONGEST model. Technical Report 2305.04358, arXiv, 2023. URL: https://doi.org/10.48550/arXiv.2305.04358.
  8. Yi-Jun Chang, Qizheng He, Wenzheng Li, Seth Pettie, and Jara Uitto. The complexity of distributed edge coloring with small palettes. In SODA, pages 2633-2652. SIAM, 2018. URL: https://doi.org/10.1137/1.9781611975031.168.
  9. Yi-Jun Chang, Wenzheng Li, and Seth Pettie. Distributed (Δ+1)-coloring via ultrafast graph shattering. SIAM J. Computing, 49(3):497-539, 2020. URL: https://doi.org/10.1137/19M1249527.
  10. Kai-Min Chung, Seth Pettie, and Hsin-Hao Su. Distributed algorithms for the Lovász local lemma and graph coloring. Distributed Comput., 30(4):261-280, 2017. URL: https://doi.org/10.1007/s00446-016-0287-6.
  11. Michael Elkin and Shaked Matar. Near-additive spanners in low polynomial deterministic CONGEST time. In PODC, pages 531-540. ACM, 2019. URL: https://doi.org/10.1145/3293611.3331635.
  12. Michael Elkin, Seth Pettie, and Hsin-Hao Su. (2Δ-1)-edge-coloring is much easier than maximal matching in the distributed setting. In SODA, pages 355-370. SIAM, 2015. URL: https://doi.org/10.1137/1.9781611973730.26.
  13. Salwa Faour, Mohsen Ghaffari, Christoph Grunau, Fabian Kuhn, and Václav Rozhoň. Local distributed rounding: Generalized to MIS, matching, set cover, and beyond. In SODA, pages 4409-4447. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.ch168.
  14. Manuela Fischer, Magnús M. Halldórsson, and Yannic Maus. Fast distributed Brooks' theorem. In SODA, pages 2567-2588. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.ch98.
  15. Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, and Alexandre Nolin. Coloring fast with broadcasts. In SPAA, pages 455-465. ACM, 2023. URL: https://doi.org/10.1145/3558481.3591095.
  16. Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, and Alexandre Nolin. A distributed palette sparsification theorem. Technical Report 2301.06457, arXiv, 2023. URL: https://doi.org/10.48550/arxiv.2301.06457.
  17. Maxime Flin, Magnús M. Halldórsson, and Alexandre Nolin. Fast coloring despite congested relays. Technical Report 2308.01359, arXiv, 2023. Full version of this paper. URL: https://doi.org/10.48550/arxiv.2308.01359.
  18. Pierre Fraigniaud, Magnús M. Halldórsson, and Alexandre Nolin. Distributed testing of distance-k colorings. In SIROCCO, volume 12156 of LNCS, pages 275-290. Springer, 2020. URL: https://doi.org/10.1007/978-3-030-54921-3_16.
  19. Pierre Fraigniaud, Marc Heinrich, and Adrian Kosowski. Local conflict coloring. In FOCS, 2016. URL: https://doi.org/10.1109/FOCS.2016.73.
  20. Mohsen Ghaffari. An improved distributed algorithm for maximal independent set. In SODA, pages 270-277. SIAM, 2016. URL: https://doi.org/10.1137/1.9781611974331.ch20.
  21. Mohsen Ghaffari. Distributed maximal independent set using small messages. In SODA, pages 805-820. SIAM, 2019. URL: https://doi.org/10.1137/1.9781611975482.50.
  22. Mohsen Ghaffari and Christoph Grunau. Faster deterministic distributed MIS and approximate matching. STOC, abs/2303.16043, 2023. URL: https://doi.org/10.48550/arXiv.2303.16043.
  23. Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, and Václav Rozhoň. Improved distributed network decomposition, hitting sets, and spanners, via derandomization. In SODA, pages 2532-2566. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.ch97.
  24. Mohsen Ghaffari, Christoph Grunau, and Václav Rozhoň. Improved deterministic network decomposition. In SODA, 2021. URL: https://arxiv.org/abs/2007.08253.
  25. Mohsen Ghaffari and Fabian Kuhn. Deterministic distributed vertex coloring: Simpler, faster, and without network decomposition. In FOCS, pages 1009-1020. IEEE Computer Society, 2021. URL: https://doi.org/10.1109/FOCS52979.2021.00101.
  26. Mohsen Ghaffari and Julian Portmann. Improved network decompositions using small messages with applications on MIS, neighborhood covers, and beyond. In DISC, volume 146 of LIPIcs, pages 18:1-18:16. LZI, 2019. URL: https://doi.org/10.4230/LIPIcs.DISC.2019.18.
  27. Magnús M. Halldórsson, Fabian Kuhn, and Yannic Maus. Distance-2 coloring in the CONGEST model. In PODC, pages 233-242. ACM, 2020. URL: https://doi.org/10.1145/3382734.3405706.
  28. Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, and Alexandre Nolin. Coloring fast without learning your neighbors' colors. In DISC, pages 39:1-39:17. LZI, 2020. URL: https://doi.org/10.4230/LIPIcs.DISC.2020.39.
  29. Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, and Tigran Tonoyan. Efficient randomized distributed coloring in CONGEST. In STOC, pages 1180-1193. ACM, 2021. URL: https://doi.org/10.1145/3406325.3451089.
  30. Magnús M. Halldórsson and Alexandre Nolin. Superfast coloring in CONGEST via efficient color sampling. Theor. Comput. Sci., 948:113711, 2023. URL: https://doi.org/10.1016/j.tcs.2023.113711.
  31. Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin, and Tigran Tonoyan. Near-optimal distributed degree+1 coloring. In STOC, pages 450-463. ACM, 2022. URL: https://doi.org/10.1145/3519935.3520023.
  32. Magnús M. Halldórsson, Alexandre Nolin, and Tigran Tonoyan. Overcoming congestion in distributed coloring. In PODC, pages 26-36. ACM, 2022. URL: https://doi.org/10.1145/3519270.3538438.
  33. David G. Harris, Johannes Schneider, and Hsin-Hao Su. Distributed (Δ + 1)-coloring in sublogarithmic rounds. Journal of the ACM, 65:19:1-19:21, 2018. URL: https://doi.org/10.1145/3178120.
  34. Öjvind Johansson. Simple distributed Δ+1-coloring of graphs. Inf. Process. Lett., 70(5):229-232, 1999. URL: https://doi.org/10.1016/S0020-0190(99)00064-2.
  35. Sven Oliver Krumke, Madhav V. Marathe, and S. S. Ravi. Models and approximation algorithms for channel assignment in radio networks. Wirel. Networks, 7(6):575-584, 2001. URL: https://doi.org/10.1023/A:1012311216333.
  36. Nathan Linial. Locality in distributed graph algorithms. SIAM J. Computing, 21(1):193-201, 1992. URL: https://doi.org/10.1137/0221015.
  37. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM J. Computing, 15:1036-1053, 1986. URL: https://doi.org/10.1137/0215074.
  38. Yannic Maus, Saku Peltonen, and Jara Uitto. Distributed symmetry breaking on power graphs via sparsification. In PODC, pages 157-167. ACM, 2023. full version available at https://doi.org/10.48550/arXiv.2302.06878. URL: https://doi.org/10.1145/3583668.3594579.
  39. Yannic Maus and Tigran Tonoyan. Linial for lists. Distributed Comput., 35(6):533-546, 2022. URL: https://doi.org/10.1007/s00446-022-00424-y.
  40. Yannic Maus and Jara Uitto. Efficient CONGEST algorithms for the Lovász local lemma. In DISC, volume 209 of LIPIcs, pages 31:1-31:19. LZI, 2021. URL: https://doi.org/10.4230/LIPIcs.DISC.2021.31.
  41. Seth Pettie and Hsin-Hao Su. Distributed coloring algorithms for triangle-free graphs. Inf. Comput., 243:263-280, 2015. URL: https://doi.org/10.1016/j.ic.2014.12.018.
  42. Bruce A. Reed. ω, Δ, and χ. J. Graph Theory, 27(4):177-212, 1998. URL: https://doi.org/10.1002/(SICI)1097-0118(199804)27:4<177::AID-JGT1>3.0.CO;2-K.
  43. Václav Rozhon and Mohsen Ghaffari. Polylogarithmic-time deterministic network decomposition and distributed derandomization. In STOC, pages 350-363. ACM, 2020. URL: https://doi.org/10.1145/3357713.3384298.
  44. Johannes Schneider and Roger Wattenhofer. A new technique for distributed symmetry breaking. In PODC, pages 257-266. ACM, 2010. URL: https://doi.org/10.1145/1835698.1835760.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact