Document Open Access Logo

Faster Dynamic (Δ+1)-Coloring Against Adaptive Adversaries

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

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICALP.2025.79.pdf
  • Filesize: 0.85 MB
  • 21 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Dynamic graph algorithms
Keywords
  • Dynamic Graph Algorithms
  • Coloring

Metrics

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

Abstract

We consider the problem of maintaining a proper (Δ + 1)-vertex coloring in a graph on n-vertices and maximum degree Δ undergoing edge insertions and deletions. We give a randomized algorithm with amortized update time Õ(n^{2/3}) against adaptive adversaries, meaning that updates may depend on past decisions by the algorithm. This improves on the very recent Õ(n^{8/9})-update-time algorithm by Behnezhad, Rajaraman, and Wasim (SODA 2025) and matches a natural barrier for dynamic (Δ+1)-coloring algorithms. The main improvements are on the densest regions of the graph, where we use structural hints from the study of distributed graph algorithms.

Cite As Get BibTex

Maxime Flin and Magnús M. Halldórsson. Faster Dynamic (Δ+1)-Coloring Against Adaptive Adversaries. In 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 334, pp. 79:1-79:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ICALP.2025.79

Author Details

Maxime Flin
  • Reykjavik University, Iceland
Magnús M. Halldórsson
  • Reykjavik University, Iceland

Funding

  • Flin, Maxime: Supported by the Icelandic Research Fund Grant No. 2310015-053.
  • Halldórsson, Magnús M.: Supported by the Icelandic Research Fund Grant No. 2511609.

Acknowledgements

Discussions with participants of Dagstuhl Seminar 24471, Graph Algorithms: Distributed Meets Dynamic, served as a key motivation for this work.

References

  1. Sepehr Assadi, Yu Chen, and Sanjeev Khanna. Sublinear algorithms for (Δ + 1) vertex coloring. In the Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 767-786, 2019. URL: https://doi.org/10.1137/1.9781611975482.48.
  2. Sepehr Assadi and Helia Yazdanyar. Simple sublinear algorithms for (Δ + 1) vertex coloring via asymmetric palette sparsification. In Ioana Oriana Bercea and Rasmus Pagh, editors, 2025 Symposium on Simplicity in Algorithms, SOSA 2025, New Orleans, LA, USA, January 13-15, 2025, pages 1-8. SIAM, 2025. URL: https://doi.org/10.1137/1.9781611978315.1.
  3. Leonid Barenboim, Michael Elkin, Seth Pettie, and Johannes Schneider. The locality of distributed symmetry breaking. J. ACM, 63(3):20:1-20:45, 2016. URL: https://doi.org/10.1145/2903137.
  4. Soheil Behnezhad, Rajmohan Rajaraman, and Omer Wasim. Fully dynamic (Δ + 1)-coloring against adaptive adversaries. In Yossi Azar and Debmalya Panigrahi, editors, Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025, New Orleans, LA, USA, January 12-15, 2025, pages 4983-5026. SIAM, 2025. URL: https://doi.org/10.1137/1.9781611978322.169.
  5. Sayan Bhattacharya, Deeparnab Chakrabarty, Monika Henzinger, and Danupon Nanongkai. Dynamic algorithms for graph coloring. In Artur Czumaj, editor, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pages 1-20. SIAM, 2018. URL: https://doi.org/10.1137/1.9781611975031.1.
  6. Sayan Bhattacharya, Fabrizio Grandoni, Janardhan Kulkarni, Quanquan C. Liu, and Shay Solomon. Fully dynamic (Δ +1)-coloring in O(1) update time. ACM Trans. Algorithms, 18(2):10:1-10:25, 2022. URL: https://doi.org/10.1145/3494539.
  7. Yi-Jun Chang, Manuela Fischer, Mohsen Ghaffari, Jara Uitto, and Yufan Zheng. The complexity of (Δ+1) coloring in congested clique, massively parallel computation, and centralized local computation. In Peter Robinson and Faith Ellen, editors, Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, July 29 - August 2, 2019, pages 471-480. ACM, 2019. URL: https://doi.org/10.1145/3293611.3331607.
  8. Yi-Jun Chang, Wenzheng Li, and Seth Pettie. Distributed (Δ+1)-coloring via ultrafast graph shattering. SIAM J. Comput., 49(3):497-539, 2020. URL: https://doi.org/10.1137/19M1249527.
  9. Yi-Jun Chang, Gopinath Mishra, Hung Thuan Nguyen, and Farrel D. Salim. Round and communication efficient graph coloring. CoRR, abs/2412.12589, 2024. URL: https://doi.org/10.48550/arXiv.2412.12589.
  10. Artur Czumaj, Peter Davies, and Merav Parter. Simple, deterministic, constant-round coloring in congested clique and MPC. SIAM J. Comput., 50(5):1603-1626, 2021. URL: https://doi.org/10.1137/20M1366502.
  11. Benjamin Doerr. Probabilistic tools for the analysis of randomized optimization heuristics. In Benjamin Doerr and Frank Neumann, editors, Theory of Evolutionary Computation - Recent Developments in Discrete Optimization, Natural Computing Series, pages 1-87. Springer, 2020. URL: https://doi.org/10.1007/978-3-030-29414-4_1.
  12. Devdatt P. Dubhashi and Alessandro Panconesi. Concentration of measure for the analysis of randomized algorithms. Cambridge University Press, Cambridge, 2009. URL: https://doi.org/10.1017/CBO9780511581274.
  13. Michael Elkin, Seth Pettie, and Hsin-Hao Su. (2Δ - l)-edge-coloring is much easier than maximal matching in the distributed setting. In Piotr Indyk, editor, 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. SIAM, 2015. URL: https://doi.org/10.1137/1.9781611973730.26.
  14. Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, and Alexandre Nolin. Coloring fast with broadcasts. In Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2023, Orlando, FL, USA, June 17-19, 2023, pages 455-465. ACM, 2023. URL: https://doi.org/10.1145/3558481.3591095.
  15. Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, and Alexandre Nolin. A distributed palette sparsification theorem. In Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024. SIAM, 2024. URL: https://doi.org/10.1137/1.9781611977912.142.
  16. Maxime Flin and Parth Mittal. (Δ+1) vertex coloring in O(n) communication. In Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, PODC 2024, Nantes, France, June 17-21, 2024, pages 416-424. ACM, 2024. URL: https://doi.org/10.1145/3662158.3662796.
  17. Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, and Tigran Tonoyan. Efficient randomized distributed coloring in CONGEST. In Samir Khuller and Virginia Vassilevska Williams, editors, STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021, pages 1180-1193. ACM, 2021. URL: https://doi.org/10.1145/3406325.3451089.
  18. Magnús M. Halldórsson, Alexandre Nolin, and Tigran Tonoyan. Ultrafast distributed coloring of high degree graphs. CoRR, abs/2105.04700, 2021. URL: https://arxiv.org/abs/2105.04700.
  19. David G. Harris, Johannes Schneider, and Hsin-Hao Su. Distributed (Δ +1)-coloring in sublogarithmic rounds. J. ACM, 65(4):19:1-19:21, 2018. URL: https://doi.org/10.1145/3178120.
  20. Monika Henzinger and Pan Peng. Constant-time dynamic (Δ +1)-coloring. ACM Trans. Algorithms, 18(2):16:1-16:21, 2022. URL: https://doi.org/10.1145/3501403.
  21. William Kuszmaul and Qi Qi. The multiplicative version of azuma’s inequality, with an application to contention analysis. CoRR, abs/2102.05077, 2021. URL: https://arxiv.org/abs/2102.05077.
  22. Nathan Linial. Locality in distributed graph algorithms. SIAM J. Comput., 21(1):193-201, 1992. URL: https://doi.org/10.1137/0221015.
  23. Michael Molloy and Bruce Reed. Graph colouring and the probabilistic method, volume 23. Springer Science & Business Media, 2002. URL: https://doi.org/10.1007/978-3-642-04016-0.
  24. Bruce A. Reed. ω, Δ, and χ. J. Graph Theory, 27(4):177-212, 1998. URL: https://doi.org/10.1002/(SICI)1097-0118(199804)27:4%3C177::AID-JGT1%3E3.0.CO;2-K.
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-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact