Skip to main content
SpringerLink
Log in

Improved distributed degree splitting and edge coloring

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

The degree splitting problem requires coloring the edges of a graph red or blue such that each node has almost the same number of edges in each color, up to a small additive discrepancy. The directed variant of the problem requires orienting the edges such that each node has almost the same number of incoming and outgoing edges, again up to a small additive discrepancy. We present deterministic distributed algorithms for both variants, which improve on their counterparts presented by Ghaffari and Su (Proc SODA 2017:2505–2523, 2017): our algorithms are significantly simpler and faster, and have a much smaller discrepancy. This also leads to a faster and simpler deterministic algorithm for \((2+o(1))\varDelta \)-edge-coloring, improving on that of Ghaffari and Su.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Barenboim, L., Elkin, M.: Distributed deterministic edge coloring using bounded neighborhood independence. Proc. PODC 2011, 129–138 (2011)

    MATH  Google Scholar 

  2. Beck, J., Fiala, T.: “Integer-making” theorems. Discrete Appl. Math. 3(1), 1–8 (1981)

    Article  MathSciNet  Google Scholar 

  3. Bednarchak, D., Helm, M.: A note on the Beck–Fiala theorem. Combinatorica 17(1), 147–149 (1997)

    Article  MathSciNet  Google Scholar 

  4. Brandt, S., Fischer, O., Hirvonen, J., Keller, B., Lempiäinen, T., Rybicki, J., Suomela, J., Uitto, J.: A lower bound for the distributed Lovász local lemma. Proc. STOC 2016, 479–488 (2016)

    MATH  Google Scholar 

  5. Bukh, B.: An improvement of the Beck–Fiala theorem. Comb. Probab. Comput. 25(03), 380–398 (2016)

    Article  MathSciNet  Google Scholar 

  6. Chang, Y.J., Kopelowitz, T., Pettie, S.: An exponential separation between randomized and deterministic complexity in the local model. Proc. FOCS 2016, 615–624 (2016)

    MathSciNet  MATH  Google Scholar 

  7. Chazelle, B.: The Discrepancy Method: Randomness and Complexity. Cambridge University Press, Cambridge (2000)

    Book  Google Scholar 

  8. Czygrinow, A., Hańćkowiak, M., Karoński, M.: Distributed \(O(\Delta \log n)\)-edge-coloring algorithm. Proc. ESA 2001, 345–355 (2001)

    MATH  Google Scholar 

  9. Dinitz, Y.: Dinitz’ algorithm: the original version and Even’s version. In: Goldreich, O., Rosenberg, A.L., Selman, A.L. (eds.) Theoretical Computer Science, Essays in Memory of Shimon Even, pp. 218–240. Springer, Berlin (2006)

    Chapter  Google Scholar 

  10. Fischer, M., Ghaffari, M., Kuhn, F.: Deterministic distributed edge-coloring via hypergraph maximal matching. In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15–17, 2017, pp. 180–191 (2017)

  11. Ghaffari, M., Harris, D.G., Kuhn, F.: On derandomizing local distributed algorithms. In: 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS (2018)

  12. Ghaffari, M., Hirvonen, J., Kuhn, F., Maus, Y., Suomela, J., Uitto, J.: Improved distributed degree splitting and edge coloring. In: Proceedings of the 31st Symposium on Distributed Computing (DISC), pp. 19:1–19:15 (2017)

  13. Ghaffari, M., Kuhn, F., Maus, Y., Uitto, J.: Deterministic distributed edge-coloring with fewer colors. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25–29, 2018, pp. 418–430 (2018)

  14. Ghaffari, M., Su, H.H.: Distributed degree splitting, edge coloring, and orientations. Proc. SODA 2017, 2505–2523 (2017)

    MathSciNet  MATH  Google Scholar 

  15. Hańćkowiak, M., Karoński, M., Panconesi, A.: On the distributed complexity of computing maximal matchings. SIAM J. Discrete Math. 15(1), 41–57 (2001)

    Article  MathSciNet  Google Scholar 

  16. Harris, D.G.: Distributed approximation algorithms for maximum matching in graphs and hypergraphs. ArXiv e-prints (2018)

  17. Israeli, A., Shiloach, Y.: An improved parallel algorithm for maximal matching. Inf. Process. Lett. 22(2), 57–60 (1986)

    Article  MathSciNet  Google Scholar 

  18. Karloff, H.J., Shmoys, D.B.: Efficient parallel algorithms for edge coloring problems. J. Algorithms 8(1), 39–52 (1987)

    Article  MathSciNet  Google Scholar 

  19. Linial, N.: Distributive graph algorithms—global solutions from local data. Proc. FOCS 1987, 331–335 (1987)

    Google Scholar 

  20. Naor, M., Stockmeyer, L.: What can be computed locally? Proc. STOC 1993, 184–193 (1993)

    MATH  Google Scholar 

  21. Panconesi, A., Rizzi, R.: Some simple distributed algorithms for sparse networks. Distrib. Comput. 14(2), 97–100 (2001)

    Article  Google Scholar 

  22. Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM, Philadelphia (2000)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ETH Zurich, Zurich, Switzerland

    Mohsen Ghaffari & Jara Uitto

  2. Aalto University, Helsinki, Finland

    Juho Hirvonen & Jukka Suomela

  3. University of Freiburg, Freiburg, Germany

    Fabian Kuhn, Yannic Maus & Jara Uitto

Authors
  1. Mohsen Ghaffari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Juho Hirvonen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fabian Kuhn
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yannic Maus
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jukka Suomela
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Jara Uitto
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fabian Kuhn.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Juho Hirvonen was supported by Ulla Tuominen Foundation. Fabian Kuhn, Yannic Maus and Jara Uitto were partly supported by ERC Grant No. 336495 (ACDC). A preliminary version of this paper appeared in the 31st International Symposium on Distributed Computing (DISC 2017) [12].

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ghaffari, M., Hirvonen, J., Kuhn, F. et al. Improved distributed degree splitting and edge coloring. Distrib. Comput. 33, 293–310 (2020). https://doi.org/10.1007/s00446-018-00346-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-018-00346-8

Keywords

Search

Navigation