Document Open Access Logo

On the Complexity of Distributed Edge Coloring and Orientation Problems

Authors Sebastian Brandt , Fabian Kuhn , Zahra Parsaeian

PDF

File

Thumbnail PDF
PDF
LIPIcs.OPODIS.2025.25.pdf
  • Filesize: 1.12 MB
  • 18 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Graph algorithms analysis
Keywords
  • LCL problems
  • binary labeling problems
  • degree splitting

Metrics

Abstract

Understanding the role of randomness when solving locally checkable labeling (LCL) problems in the LOCAL model has been one of the top priorities in the research on distributed graph algorithms in recent years. For LCL problems in bounded-degree graphs, it is known that randomness cannot help more than polynomially, except in one case: if the deterministic complexity of an LCL problem is in Ω(log n) and its randomized complexity is in o(log n), then the randomized complexity is guaranteed to be O(poly(log log n)) and it is even known to be O(log log n) in bounded-degree trees. However, the fundamental question of which problems with a deterministic complexity of Ω(log n) can be solved exponentially faster using randomization still remains wide open.
We make a step towards answering this question by studying a simple, but natural class of LCL problems: so-called degree splitting problems. These problems come in two varieties: coloring problems where the edges of a graph have to be colored with 2 colors and orientation problems where each edge needs to be oriented. For an exact classification, it is most natural to consider the Δ-regular case (for Δ = O(1)), where we obtain the following results.  
- We exactly characterize the complexity of problems where the edges need to be colored with two colors, say red and blue. We show that for every y ∈ {0,… ,Δ-1}, the problem of red-blue coloring the edges such that every node of degree Δ has either y or y+1 red edges has randomized complexity O(log log n) in general graphs of maximum degree Δ. Any other problem, i.e., any problem that does not allow two consecutive red degrees, is already known to have randomized complexity Ω(log n) even in Δ-regular trees. We note that a set of edges F such that every node has either y or y+1 incident edges in F is also known as a {y,y+1}-factor of a graph. 
- For edge orientations, we show that for any two r₁ and r₂ such that r₁,r₂ ≤ Δ/2 and r₁+r₂ ≥ Δ/2, there are randomized algorithms with round complexities O(log log n) in trees and Õ(log⁴log n) in general graphs to compute an edge orientation such that all nodes have outdegree r₁ ± O(√{ΔlogΔ}) or Δ-r₂ ± O(√{ΔlogΔ}). Further, there exists a constant c > 0 such that for any 0 ≤ r₁+r₂ ≤ Δ/2, the problem of computing an edge orientation in which all outdegrees are either at most r₁-c⋅ √{Δ} or at least Δ-r₂+c⋅√{Δ} has randomized complexity Ω(log n) even in Δ-regular trees.
While our results are cleanest to state for the Δ-regular case, all our algorithms naturally generalize to nodes of any degree d < Δ in general graphs of maximum degree Δ. All our algorithms also naturally generalize to the unbounded degree case and they then have a randomized complexity of Õ(Δ) ⋅ log log n (resp. Õ(Δ ⋅log⁴log n) for orienting general graphs).

Cite As Get BibTex

Sebastian Brandt, Fabian Kuhn, and Zahra Parsaeian. On the Complexity of Distributed Edge Coloring and Orientation Problems. In 29th International Conference on Principles of Distributed Systems (OPODIS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 361, pp. 25:1-25:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.OPODIS.2025.25

Author Details

Sebastian Brandt
  • CISPA Saarbrücken, Germany
Fabian Kuhn
  • University of Freiburg, Germany
Zahra Parsaeian
  • University of Freiburg, Germany

References

  1. Jin Akiyama and Mikio Kano. Factors and Factorizations of Graphs. Springer, 2011. Google Scholar
  2. Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Mikaël Rabie, and Jukka Suomela. The distributed complexity of locally checkable problems on paths is decidable. In Proc. 38th ACM Symp. on Principles of Distributed Computing (PODC), pages 262-271, 2019. URL: https://doi.org/10.1145/3293611.3331606.
  3. Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, and Jukka Suomela. Efficient classification of locally checkable problems in regular trees. In Proc. 36th Int. Symp. on Distributed Computing (DISC), volume 246 of LIPIcs, pages 8:1-8:19, 2022. URL: https://doi.org/10.4230/LIPICS.DISC.2022.8.
  4. Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, and Jukka Suomela. Classification of distributed binary labeling problems. In Proc. 34th Int. Symp. on Distributed Computing (DISC), volume 179 of LIPIcs, pages 17:1-17:17, 2020. URL: https://doi.org/10.4230/LIPICS.DISC.2020.17.
  5. Alkida Balliu, Sebastian Brandt, Dennis Olivetti, and Jukka Suomela. Almost global problems in the LOCAL model. In Proc. 32nd Int. Symp. on Distributed Computing (DISC), volume 121 of LIPIcs, pages 9:1-9:16, 2018. URL: https://doi.org/10.4230/LIPICS.DISC.2018.9.
  6. Alkida Balliu, Sebastian Brandt, Dennis Olivetti, and Jukka Suomela. How much does randomness help with locally checkable problems? In Proc. 39th ACM Symp. on Principles of Distributed Computing (PODC), pages 299-308, 2020. URL: https://doi.org/10.1145/3382734.3405715.
  7. Alkida Balliu, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Dennis Olivetti, and Jukka Suomela. New classes of distributed time complexity. In Proc. 50th ACM Symposium on Theory of Computing (STOC), pages 1307-1318, 2018. URL: https://doi.org/10.1145/3188745.3188860.
  8. Alkida Balliu, Juho Hirvonen, Dennis Olivetti, and Jukka Suomela. Hardness of minimal symmetry breaking in distributed computing. In Proc. 38th ACM Symp. on Principles of Distributed Computing (PODC), pages 369-378, 2019. URL: https://doi.org/10.1145/3293611.3331605.
  9. Leonid Barenboim and Michael Elkin. Deterministic distributed vertex coloring in polylogarithmic time. Journal of ACM, 58:23:1-23:25, 2011. URL: https://doi.org/10.1145/2027216.2027221.
  10. Leonid Barenboim and Michael Elkin. Distributed Graph Coloring: Fundamentals and Recent Developments. Morgan & Claypool Publishers, 2013. URL: https://doi.org/10.2200/S00520ED1V01Y201307DCT011.
  11. Anton Bernshteyn. A fast distributed algorithm for (Δ+1)-edge-coloring. J. Comb. Theory B, 152:319-352, 2022. Google Scholar
  12. Sebastian Brandt. An automatic speedup theorem for distributed problems. In Peter Robinson and Faith Ellen, editors, Proc. 38th ACM Symp. on Principles of Distributed Computing (PODC), pages 379-388, 2019. URL: https://doi.org/10.1145/3293611.3331611.
  13. Sebastian Brandt, Orr Fischer, Juho Hirvonen, Barbara Keller, Tuomo Lempiäinen, Joel Rybicki, Jukka Suomela, and Jara Uitto. A lower bound for the distributed lovász local lemma. In Daniel Wichs and Yishay Mansour, editors, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016, pages 479-488. ACM, 2016. URL: https://doi.org/10.1145/2897518.2897570.
  14. Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, and Przemyslaw Uznanski. LCL problems on grids. In Proc. 36th ACM Symp. on Principles of Distributed Computing (PODC), pages 101-110. ACM, 2017. URL: https://doi.org/10.1145/3087801.3087833.
  15. Sebastian Brandt, Fabian Kuhn, and Zahra Parsaeian. On the complexity of distributed edge coloring and orientation problems, 2025. URL: https://arxiv.org/abs/2510.21327.
  16. Sebastian Brandt, Yannic Maus, Ananth Narayanan, Florian Schager, and Jara Uitto. On the locality of hall’s theorem. 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 4198-4226. SIAM, 2025. URL: https://doi.org/10.1137/1.9781611978322.143.
  17. Y.-J. Chang, T. Kopelowitz, and S. Pettie. An exponential separation between randomized and deterministic complexity in the LOCAL model. In Proc. 47th Symp. on Foundations of Computer Science (FOCS), pages 615-624, 2016. Google Scholar
  18. Yi-Jun Chang. The complexity landscape of distributed locally checkable problems on trees. In Hagit Attiya, editor, Proc. 34th Int. Symp. on Distributed Computing (DISC), volume 179 of LIPIcs, pages 18:1-18:17, 2020. URL: https://doi.org/10.4230/LIPICS.DISC.2020.18.
  19. Yi-Jun Chang, Qizheng He, Wenzheng Li, Seth Pettie, and Jara Uitto. Distributed edge coloring and a special case of the constructive lovász local lemma. ACM Trans. Algorithms, 16(1):8:1-8:51, 2020. URL: https://doi.org/10.1145/3365004.
  20. Yi-Jun Chang and Seth Pettie. A time hierarchy theorem for the LOCAL model. In Chris Umans, editor, Proc. 58th IEEE Symp. on Foundations of Computer Science (FOCS), pages 156-167, 2017. URL: https://doi.org/10.1109/FOCS.2017.23.
  21. Kai-Min Chung, Seth Pettie, and Hsin-Hao Su. Distributed algorithms for the lovász local lemma and graph coloring. In Proc. ACM Symp. on Principles of Distributed Computing (PODC), pages 134-143. ACM, 2014. URL: https://doi.org/10.1145/2611462.2611465.
  22. Kai-Min Chung, Seth Pettie, and Hsin-Hao Su. Distributed algorithms for the lovász local lemma and graph coloring. Distributed Computing, 30(4):261-280, 2017. URL: https://doi.org/10.1007/S00446-016-0287-6.
  23. Peter Davies. Improved distributed algorithms for the lovász local lemma and edge coloring. In Proc. 34th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 4273-4295, 2023. URL: https://doi.org/10.1137/1.9781611977554.CH163.
  24. Pierre Fraigniaud, Marc Heinrich, and Adrian Kosowski. Local conflict coloring. In Proc. 57th IEEE Symp. on Foundations of Computer Science (FOCS), pages 625-634, 2016. URL: https://doi.org/10.1109/FOCS.2016.73.
  25. M. Ghaffari, F. Kuhn, and Y. Maus. On the complexity of local distributed graph problems. In Proc. 49th ACM Symp. on Theory of Computing (STOC), pages 784-797, 2017. Google Scholar
  26. Mohsen Ghaffari and Christoph Grunau. Near-optimal deterministic network decomposition and ruling set, and improved MIS. In Proc. 65th IEEE Symp. on Foundations of Computer Science (FOCS), pages 2148-2179, 2024. URL: https://doi.org/10.1109/FOCS61266.2024.00007.
  27. Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, and Václav Rozhon. Improved distributed network decomposition, hitting sets, and spanners, via derandomization. In Proc. 34th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023. Google Scholar
  28. Mohsen Ghaffari, Christoph Grunau, and Václav Rozhon. Improved deterministic network decomposition. In Proc. 32nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2904-2923, 2021. URL: https://doi.org/10.1137/1.9781611976465.173.
  29. Mohsen Ghaffari, David G. Harris, and Fabian Kuhn. On derandomizing local distributed algorithms. In Proc. 59th Symp. on Foundations of Computer Science (FOCS), pages 662-673, 2018. URL: https://doi.org/10.1109/FOCS.2018.00069.
  30. Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, and Jara Uitto. Improved distributed degree splitting and edge coloring. Distributed Computing, 33(3-4):293-310, 2020. URL: https://doi.org/10.1007/S00446-018-00346-8.
  31. Mohsen Ghaffari and Fabian Kuhn. On the use of randomness in local distributed graph algorithms. In Proc. 38th ACM Symp. on Principles of Distributed Computing (PODC), pages 290-299, 2019. URL: https://doi.org/10.1145/3293611.3331610.
  32. Mohsen Ghaffari and Fabian Kuhn. Deterministic distributed vertex coloring: Simpler, faster, and without network decomposition. In Proc. 62nd IEEE Symp. on Foundations of Computing (FOCS), 2021. Google Scholar
  33. Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, and Jara Uitto. Deterministic distributed edge-coloring with fewer colors. In Proc. 50th ACM Symp. on Theory of Computing (STOC), pages 418-430, 2018. URL: https://doi.org/10.1145/3188745.3188906.
  34. Mohsen Ghaffari and Hsin-Hao Su. Distributed degree splitting, edge coloring, and orientations. In Proc. 28th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 2505-2523, 2017. URL: https://doi.org/10.1137/1.9781611974782.166.
  35. Andrew V Goldberg and Serge A Plotkin. Parallel (δ+ 1)-coloring of constant-degree graphs. Information Processing Letters, 25(4):241-245, 1987. Google Scholar
  36. Christoph Grunau, Václav Rozhon, and Sebastian Brandt. The landscape of distributed complexities on trees and beyond. In Alessia Milani and Philipp Woelfel, editors, Proc. 41st ACM Symp. on Principles of Distributed Computing (PODC), pages 37-47, 2022. URL: https://doi.org/10.1145/3519270.3538452.
  37. Manuel Jakob and Yannic Maus. Brief announcement: Towards optimal distributed delta coloring. In Alkida Balliu and Fabian Kuhn, editors, Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2025, Hotel Las Brisas Huatulco, Huatulco, Mexico, June 16-20, 2025, pages 318-321. ACM, 2025. URL: https://doi.org/10.1145/3732772.3733519.
  38. Manuel Jakob, Yannic Maus, and Florian Schager. Towards optimal distributed edge coloring with fewer colors, 2025. URL: https://arxiv.org/abs/2504.13003.
  39. Amos Korman, Jean-Sébastien Sereni, and Laurent Viennot. Toward more localized local algorithms: removing assumptions concerning global knowledge. Distributed Comput., 26(5-6):289-308, 2013. URL: https://doi.org/10.1007/S00446-012-0174-8.
  40. Fabian Kuhn. Local weak coloring algorithms and implications on deterministic symmetry breaking. In Proc. 21st ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), 2009. Google Scholar
  41. Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer. Local computation: Lower and upper bounds. Journal of ACM, 63:17:1-17:44, 2016. URL: https://doi.org/10.1145/2742012.
  42. Christoph Lenzen and Roger Wattenhofer. MIS on trees. In Proceedings of the 2011 Annual ACM Symposium on Principles of Distributed (PODC), pages 41-48, 2011. URL: https://doi.org/10.1145/1993806.1993813.
  43. Nathan Linial. Locality in Distributed Graph Algorithms. SIAM Journal on Computing, 21(1):193-201, 1992. URL: https://doi.org/10.1137/0221015.
  44. M. Naor and L. Stockmeyer. What can be computed locally? SIAM J. on Comp., 24(6):1259-1277, 1995. URL: https://doi.org/10.1137/S0097539793254571.
  45. D. Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM, 2000. Google Scholar
  46. Václav Rozhoň and Mohsen Ghaffari. Polylogarithmic-time deterministic network decomposition and distributed derandomization. In Proc. 52nd ACM Symp. on Theory of Computing (STOC), pages 350-363, 2020. Google Scholar
  47. W. T. Tutte. The subgraph problem. Annals of Discrete Mathematics, 3:289-295, 1978. Google Scholar
  48. V. G. Vizing. On an estimate of the chro- matic class of a p-graph. Diskret. Analiz., 3:25-30, 1964. Google Scholar
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

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