Document Open Access Logo

Towards Optimal Distributed Edge Coloring with Fewer Colors

Authors Manuel Jakob , Yannic Maus , Florian Schager

PDF

File

Thumbnail PDF
PDF
LIPIcs.DISC.2025.37.pdf
  • Filesize: 1.04 MB
  • 26 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
Keywords
  • distributed graph algorithms
  • edge coloring
  • LOCAL model

Metrics

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

Abstract

There is a huge difference in techniques and runtimes of distributed algorithms for problems that can be solved by a sequential greedy algorithm and those that cannot. A prime example of this contrast appears in the edge coloring problem: while (2Δ-1)-edge coloring - where Δ is the maximum degree - can be solved in 𝒪(log^{∗}(n)) rounds on constant-degree graphs, the seemingly minor reduction to (2Δ-2) colors leads to an Ω(log n) lower bound [Chang, He, Li, Pettie & Uitto, SODA'18]. Understanding this sharp divide between very local problems and inherently more global ones remains a central open question in distributed computing and it is a core focus of this paper.
As our main contribution we design a deterministic distributed 𝒪(log n)-round reduction from the (2Δ-2)-edge coloring problem to the much easier (2Δ-1)-edge coloring problem. This reduction is optimal, as the (2Δ-2)-edge coloring problem admits an Ω(log n) lower bound that even holds on the class of constant-degree graphs, whereas the 2Δ-1-edge coloring problem can be solved in 𝒪(log^{∗}n) rounds. By plugging in the (2Δ-1)-edge coloring algorithms from [Balliu, Brandt, Kuhn & Olivetti, PODC'22] running in 𝒪(log^{12}Δ + log^{∗} n) rounds, we obtain an optimal runtime of 𝒪(log n) rounds as long as Δ = 2^{𝒪(log^{1/12} n)}. Previously, such an optimal algorithm was only known for the class of constant-degree graphs [Brandt, Maus, Narayanan, Schager & Uitto, SODA'25]. Furthermore, on general graphs our reduction improves the runtime from 𝒪̃(log³ n) to 𝒪̃(log^{5/3} n).
In addition, we also obtain an optimal 𝒪(log log n)-round randomized reduction of (2Δ - 2)-edge coloring to (2Δ - 1)-edge coloring. This leads to a 𝒪̃(log^{5/3} log n)-round (2Δ-2)-edge coloring algorithm, which beats the (very recent) previous state-of-the-art taking 𝒪̃(log^{8/3}log n) rounds from [Bourreau, Brandt & Nolin, STOC'25].
Lastly, we obtain an 𝒪(log_Δ n)-round reduction from the (2Δ-1)-edge coloring, albeit to the somewhat harder maximal independent set (MIS) problem.

Cite As Get BibTex

Manuel Jakob, Yannic Maus, and Florian Schager. Towards Optimal Distributed Edge Coloring with Fewer Colors. In 39th International Symposium on Distributed Computing (DISC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 356, pp. 37:1-37:26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.DISC.2025.37

Author Details

Manuel Jakob
  • TU Graz, Austria
Yannic Maus
  • TU Graz, Austria
Florian Schager
  • TU Graz, Austria

Funding

This research was funded in whole or in part by the Austrian Science Fund (FWF) https://doi.org/10.55776/P36280, https://doi.org/10.55776/I6915.

Acknowledgements

For open access purposes, the author has applied a CC BY public copyright license to any author-accepted manuscript version arising from this submission.

References

  1. Noga Alon, László Babai, and Alon Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms, 7(4):567-583, 1986. URL: https://doi.org/10.1016/0196-6774(86)90019-2.
  2. Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, and Jukka Suomela. Lower bounds for maximal matchings and maximal independent sets. In David Zuckerman, editor, 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019, pages 481-497. IEEE Computer Society, 2019. URL: https://doi.org/10.1109/FOCS.2019.00037.
  3. Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, and Jukka Suomela. Lower bounds for maximal matchings and maximal independent sets. J. ACM, 68(5):39:1-39:30, 2021. URL: https://doi.org/10.1145/3461458.
  4. Alkida Balliu, Sebastian Brandt, Fabian Kuhn, and Dennis Olivetti. Distributed edge coloring in time polylogarithmic in Δ. In Alessia Milani and Philipp Woelfel, editors, PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, pages 15-25. ACM, 2022. URL: https://doi.org/10.1145/3519270.3538440.
  5. Amotz Bar-Noy, Rajeev Motwani, and Joseph Naor. The greedy algorithm is optimal for on-line edge coloring. Inf. Process. Lett., 44(5):251-253, 1992. URL: https://doi.org/10.1016/0020-0190(92)90209-E.
  6. Leonid Barenboim. Deterministic (Δ + 1)-coloring in sublinear (in Δ) time in static, dynamic, and faulty networks. J. ACM, 63(5):47:1-47:22, 2016. URL: https://doi.org/10.1145/2979675.
  7. Leonid Barenboim and Michael Elkin. Distributed deterministic edge coloring using bounded neighborhood independence. Distributed Comput., 26(5-6):273-287, 2013. URL: https://doi.org/10.1007/S00446-012-0167-7.
  8. Leonid Barenboim and Michael Elkin. Distributed Graph Coloring: Fundamentals and Recent Developments. Morgan & Claypool Publishers, 2013. URL: https://doi.org/10.2200/S00520ED1V01Y201307DCT011.
  9. 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.
  10. Leonid Barenboim, Michael Elkin, and Fabian Kuhn. Distributed (delta+1)-coloring in linear (in delta) time. SIAM J. Comput., 43(1):72-95, 2014. URL: https://doi.org/10.1137/12088848X.
  11. Leonid Barenboim, Michael Elkin, Seth Pettie, and Johannes Schneider. The locality of distributed symmetry breaking. In 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, New Brunswick, NJ, USA, October 20-23, 2012, pages 321-330. IEEE Computer Society, 2012. URL: https://doi.org/10.1109/FOCS.2012.60.
  12. Anton Bernshteyn. A fast distributed algorithm for (Δ + 1)-edge-coloring. J. Comb. Theory B, 152:319-352, 2022. URL: https://doi.org/10.1016/J.JCTB.2021.10.004.
  13. Anton Bernshteyn and Abhishek Dhawan. Fast algorithms for vizing’s theorem on bounded degree graphs. CoRR, abs/2303.05408, 2023. URL: https://doi.org/10.48550/arXiv.2303.05408.
  14. Yann Bourreau, Sebastian Brandt, and Alexandre Nolin. Faster distributed Δ-coloring via ruling subgraphs. arXiv preprint arXiv:2503.04320, 2025. URL: https://doi.org/10.48550/arXiv.2503.04320.
  15. 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.
  16. Sebastian Brandt and Ananth Narayanan. Towards optimal deterministic local algorithms on trees, 2025. URL: https://doi.org/10.48550/arXiv.2505.01410.
  17. Yi-Jun Chang, Qizheng He, Wenzheng Li, Seth Pettie, and Jara Uitto. The complexity of distributed edge coloring with small palettes. 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 2633-2652. SIAM, 2018. URL: https://doi.org/10.1137/1.9781611975031.168.
  18. 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), November 2019. URL: https://doi.org/10.1145/3365004.
  19. Yi-Jun Chang, Tsvi Kopelowitz, and Seth Pettie. An exponential separation between randomized and deterministic complexity in the LOCAL model. SIAM J. Comput., 48(1):122-143, 2019. URL: https://doi.org/10.1137/17M1117537.
  20. Yi-Jun Chang, Wenzheng Li, and Seth Pettie. An optimal distributed (Δ+1)-coloring algorithm? In Ilias Diakonikolas, David Kempe, and Monika Henzinger, editors, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018, pages 445-456. ACM, 2018. URL: https://doi.org/10.1145/3188745.3188964.
  21. Yi-Jun Chang, Wenzheng Li, and Seth Pettie. Distributed (Δ+1)-coloring via ultrafast graph shattering. SIAM Journal of Computing, 49(3):497-539, 2020. URL: https://doi.org/10.1137/19M1249527.
  22. Yi-Jun Chang and Seth Pettie. A time hierarchy theorem for the LOCAL model. SIAM J. Comput., 48(1):33-69, 2019. URL: https://doi.org/10.1137/17M1157957.
  23. Ilan Reuven Cohen, Binghui Peng, and David Wajc. Tight bounds for online edge coloring. In David Zuckerman, editor, 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019, pages 1-25. IEEE Computer Society, 2019. URL: https://doi.org/10.1109/FOCS.2019.00010.
  24. Richard Cole and Uzi Vishkin. Deterministic coin tossing with applications to optimal parallel list ranking. Inf. Control., 70(1):32-53, 1986. URL: https://doi.org/10.1016/S0019-9958(86)80023-7.
  25. Andrzej Czygrinow, Michal Hanckowiak, and Michal Karonski. Distributed o(delta log(n))-edge-coloring algorithm. In Friedhelm Meyer auf der Heide, editor, Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings, volume 2161 of Lecture Notes in Computer Science, pages 345-355. Springer, 2001. URL: https://doi.org/10.1007/3-540-44676-1_29.
  26. Peter Davies. Improved distributed algorithms for the lovász local lemma and edge coloring. In Nikhil Bansal and Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pages 4273-4295. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.CH163.
  27. Devdatt P. Dubhashi, David A. Grable, and Alessandro Panconesi. Near-optimal, distributed edge colouring via the nibble method. Theor. Comput. Sci., 203(2):225-251, 1998. URL: https://doi.org/10.1016/S0304-3975(98)00022-X.
  28. 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.
  29. Salwa Faour, Mohsen Ghaffari, Christoph Grunau, Fabian Kuhn, and Václav Rozhon. Local distributed rounding: Generalized to mis, matching, set cover, and beyond. In Nikhil Bansal and Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pages 4409-4447. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.CH168.
  30. Manuela Fischer and Mohsen Ghaffari. Sublogarithmic distributed algorithms for lovász local lemma, and the complexity hierarchy. 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 18:1-18:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. URL: https://doi.org/10.4230/LIPICS.DISC.2017.18.
  31. Manuela Fischer, Mohsen Ghaffari, and Fabian Kuhn. Deterministic distributed edge-coloring via hypergraph maximal matching. In Chris Umans, editor, 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pages 180-191. IEEE Computer Society, 2017. URL: https://doi.org/10.1109/FOCS.2017.25.
  32. Manuela Fischer, Magnús M. Halldórsson, and Yannic Maus. Fast distributed brooks' theorem. In Nikhil Bansal and Viswanath Nagarajan, editors, Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pages 2567-2588. SIAM, 2023. URL: https://doi.org/10.1137/1.9781611977554.CH98.
  33. Pierre Fraigniaud, Marc Heinrich, and Adrian Kosowski. Local conflict coloring. In Irit Dinur, editor, IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey, USA, pages 625-634. IEEE Computer Society, 2016. URL: https://doi.org/10.1109/FOCS.2016.73.
  34. Beat Gfeller and Elias Vicari. A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs. In Indranil Gupta and Roger Wattenhofer, editors, Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, pages 53-60. ACM, 2007. URL: https://doi.org/10.1145/1281100.1281111.
  35. Mohsen Ghaffari. An improved distributed algorithm for maximal independent set. In Robert Krauthgamer, editor, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pages 270-277. SIAM, 2016. URL: https://doi.org/10.1137/1.9781611974331.CH20.
  36. Mohsen Ghaffari and Christoph Grunau. Faster deterministic distributed MIS and approximate matching. In Barna Saha and Rocco A. Servedio, editors, Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023, pages 1777-1790. ACM, 2023. URL: https://doi.org/10.1145/3564246.3585243.
  37. Mohsen Ghaffari and Christoph Grunau. Near-optimal deterministic network decomposition and ruling set, and improved MIS. In 65th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2024, Chicago, IL, USA, October 27-30, 2024, pages 2148-2179. IEEE, 2024. URL: https://doi.org/10.1109/FOCS61266.2024.00007.
  38. Mohsen Ghaffari, Christoph Grunau, and Václav Rozhon. Improved deterministic network decomposition. In Dániel Marx, editor, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021, pages 2904-2923. SIAM, 2021. URL: https://doi.org/10.1137/1.9781611976465.173.
  39. Mohsen Ghaffari, David G. Harris, and Fabian Kuhn. On derandomizing local distributed algorithms. In Mikkel Thorup, editor, 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, pages 662-673. IEEE Computer Society, 2018. URL: https://doi.org/10.1109/FOCS.2018.00069.
  40. Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, and Yannic Maus. Improved distributed delta-coloring. In Calvin Newport and Idit Keidar, editors, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, July 23-27, 2018, pages 427-436. ACM, 2018. URL: https://dl.acm.org/citation.cfm?id=3212764.
  41. Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, and Jara Uitto. Improved distributed degree splitting and edge coloring. 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 19:1-19:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. URL: https://doi.org/10.4230/LIPICS.DISC.2017.19.
  42. Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, and Jara Uitto. Improved distributed degree splitting and edge coloring. Distributed Comput., 33(3-4):293-310, 2020. URL: https://doi.org/10.1007/S00446-018-00346-8.
  43. Mohsen Ghaffari and Fabian Kuhn. Deterministic distributed vertex coloring: Simpler, faster, and without network decomposition. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022, pages 1009-1020. IEEE, 2021. URL: https://doi.org/10.1109/FOCS52979.2021.00101.
  44. Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, and Jara Uitto. Deterministic distributed edge-coloring with fewer colors. In Ilias Diakonikolas, David Kempe, and Monika Henzinger, editors, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018, pages 418-430. ACM, 2018. URL: https://doi.org/10.1145/3188745.3188906.
  45. Mohsen Ghaffari and Hsin-Hao Su. Distributed degree splitting, edge coloring, and orientations. In Philip N. Klein, editor, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, pages 2505-2523. SIAM, 2017. URL: https://doi.org/10.1137/1.9781611974782.166.
  46. Philip Hall. On representatives of subsets. Classic Papers in Combinatorics, pages 58-62, 1987. Google Scholar
  47. Magnús M. Halldórsson, Yannic Maus, and Alexandre Nolin. 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. URL: https://doi.org/10.4230/LIPICS.DISC.2022.26.
  48. David G. Harris. Distributed local approximation algorithms for maximum matching in graphs and hypergraphs. In David Zuckerman, editor, 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019, pages 700-724. IEEE Computer Society, 2019. URL: https://doi.org/10.1109/FOCS.2019.00048.
  49. David G. Harris. Distributed local approximation algorithms for maximum matching in graphs and hypergraphs. SIAM J. Comput., 49(4):711-746, 2020. URL: https://doi.org/10.1137/19M1279241.
  50. Manuel Jakob and Yannic Maus. Towards optimal distributed delta coloring. CoRR, abs/2504.03080, 2025. URL: https://doi.org/10.48550/arXiv.2504.03080.
  51. Manuel Jakob, Yannic Maus, and Florian Schager. Towards optimal distributed edge coloring with fewer colors, 2025. URL: https://arxiv.org/abs/2504.13003.
  52. Fabian Kuhn, Yannic Maus, and Simon Weidner. Deterministic distributed ruling sets of line graphs. In Zvi Lotker and Boaz Patt-Shamir, editors, Structural Information and Communication Complexity - 25th International Colloquium, SIROCCO 2018, Ma'ale HaHamisha, Israel, June 18-21, 2018, Revised Selected Papers, volume 11085 of Lecture Notes in Computer Science, pages 193-208. Springer, 2018. URL: https://doi.org/10.1007/978-3-030-01325-7_19.
  53. Fabian Kuhn and Roger Wattenhofer. On the complexity of distributed graph coloring. In Eric Ruppert and Dahlia Malkhi, editors, Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, Denver, CO, USA, July 23-26, 2006, pages 7-15. ACM, 2006. URL: https://doi.org/10.1145/1146381.1146387.
  54. Nathan Linial. Distributive graph algorithms-global solutions from local data. In 28th Annual Symposium on Foundations of Computer Science, Los Angeles, California, USA, 27-29 October 1987, pages 331-335. IEEE Computer Society, 1987. URL: https://doi.org/10.1109/SFCS.1987.20.
  55. Nathan Linial. Locality in distributed graph algorithms. SIAM J. Comput., 21(1):193-201, 1992. URL: https://doi.org/10.1137/0221015.
  56. Michael Luby. A simple parallel algorithm for the maximal independent set problem. In Robert Sedgewick, editor, Proceedings of the 17th Annual ACM Symposium on Theory of Computing, May 6-8, 1985, Providence, Rhode Island, USA, pages 1-10. ACM, 1985. URL: https://doi.org/10.1145/22145.22146.
  57. Yannic Maus and Tigran Tonoyan. 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. URL: https://doi.org/10.4230/LIPICS.DISC.2020.16.
  58. Yannic Maus and Jara Uitto. Efficient CONGEST algorithms for the lovász local lemma. 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 31:1-31:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPICS.DISC.2021.31.
  59. Moni Naor. A lower bound on probabilistic algorithms for distributive ring coloring. SIAM J. Discret. Math., 4(3):409-412, 1991. URL: https://doi.org/10.1137/0404036.
  60. Alessandro Panconesi and Romeo Rizzi. Some simple distributed algorithms for sparse networks. Distributed Comput., 14(2):97-100, 2001. URL: https://doi.org/10.1007/PL00008932.
  61. Alessandro Panconesi and Aravind Srinivasan. Improved distributed algorithms for coloring and network decomposition problems. In S. Rao Kosaraju, Mike Fellows, Avi Wigderson, and John A. Ellis, editors, Proceedings of the 24th Annual ACM Symposium on Theory of Computing, May 4-6, 1992, Victoria, British Columbia, Canada, pages 581-592. ACM, 1992. URL: https://doi.org/10.1145/129712.129769.
  62. Alessandro Panconesi and Aravind Srinivasan. The local nature of delta-coloring and its algorithmic applications. Comb., 15(2):255-280, 1995. URL: https://doi.org/10.1007/BF01200759.
  63. Alessandro Panconesi and Aravind Srinivasan. On the complexity of distributed network decomposition. J. Algorithms, 20(2):356-374, 1996. URL: https://doi.org/10.1006/JAGM.1996.0017.
  64. Václav Rozhon, Michael Elkin, Christoph Grunau, and Bernhard Haeupler. Deterministic low-diameter decompositions for weighted graphs and distributed and parallel applications. In 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31 - November 3, 2022, pages 1114-1121. IEEE, 2022. URL: https://doi.org/10.1109/FOCS54457.2022.00107.
  65. Václav Rozhon and Mohsen Ghaffari. Polylogarithmic-time deterministic network decomposition and distributed derandomization. In Konstantin Makarychev, Yury Makarychev, Madhur Tulsiani, Gautam Kamath, and Julia Chuzhoy, editors, Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020, pages 350-363. ACM, 2020. URL: https://doi.org/10.1145/3357713.3384298.
  66. Amin Saberi and David Wajc. The greedy algorithm is not optimal for on-line edge coloring. In Nikhil Bansal, Emanuela Merelli, and James Worrell, editors, 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference), volume 198 of LIPIcs, pages 109:1-109:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPICS.ICALP.2021.109.
  67. Johannes Schneider, Michael Elkin, and Roger Wattenhofer. Symmetry breaking depending on the chromatic number or the neighborhood growth. Theor. Comput. Sci., 509:40-50, 2013. URL: https://doi.org/10.1016/J.TCS.2012.09.004.
  68. Hsin-Hao Su and Hoa T. Vu. Towards the locality of vizing’s theorem. In Moses Charikar and Edith Cohen, editors, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019, pages 355-364. ACM, 2019. URL: https://doi.org/10.1145/3313276.3316393.
  69. Vadim G Vizing. On an estimate of the chromatic 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