Skip to main content
Springer Nature Link
Log in

Distributed deterministic edge coloring using bounded neighborhood independence

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known deterministic algorithms for (2Δ −1)-edge-coloring requires O(Δ) +  log* n time (Panconesi and Rizzi in Distrib Comput 14(2):97–100, 2001), where Δ is the maximum degree of the input graph. Also, recent results of Barenboim and Elkin (2010) for vertex-coloring imply that one can get an O(Δ)-edge-coloring in \({O(\Delta^{\epsilon}\cdot \log n)}\) time, and an \({O(\Delta^{1 + \epsilon})}\) -edge-coloring in O(log Δ log n) time, for an arbitrarily small constant \({\epsilon > 0}\) . In this paper we devise a significantly faster deterministic edge-coloring algorithm. Specifically, our algorithm computes an O(Δ)-edge-coloring in \({O(\Delta^{\epsilon}) + \log* n}\) time, and an \({O(\Delta^{1 + \epsilon})}\) -edge-coloring in O(log Δ) +  log* n time. This result improves the state-of-the-art running time for deterministic edge-coloring with this number of colors in almost the entire range of maximum degree Δ. Moreover, it improves it exponentially in a wide range of Δ, specifically, for 2Ω(log*n) ≤ Δ ≤ polylog(n). In addition, for small values of Δ (up to log1 - δ n, for some fixed δ > 0) our deterministic algorithm outperforms all the existing randomized algorithms for this problem. Also, our algorithm is the first O(Δ)-edge-coloring algorithm that has running time o(Δ) + log* n, for the entire range of Δ. All previous (deterministic and randomized) O(Δ)-edge-coloring algorithms require \({\Omega(\min \{\Delta, \sqrt{\log n}\ \})}\) time. On our way to these results we study the vertex-coloring problem on graphs with bounded neighborhood independence. This is a large family of graphs, which strictly includes line graphs of r-hypergraphs (i.e., hypergraphs in which each hyperedge contains r or less vertices) for r =  O(1), and graphs of bounded growth. We devise a very fast deterministic algorithm for vertex-coloring graphs with bounded neighborhood independence. This algorithm directly gives rise to our edge-coloring algorithms, which apply to general graphs. Our main technical contribution is a subroutine that computes an O(Δ/p)-defective p-vertex coloring of graphs with bounded neighborhood independence in O(p 2) + log* n time, for a parameter p, 1 ≤ p ≤ Δ. In all previous efficient distributed routines for m-defective p-coloring the product m· p is super-linear in Δ. In our routine this product is linear in Δ, and this enables us to speed up the algorithm drastically.

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

Access this article

Log in via an institution

Subscribe and save

Springer+
from $39.99 /Month
  • Starting from 10 chapters or articles per month
  • Access and download chapters and articles from more than 300k books and 2,500 journals
  • Cancel anytime
View plans

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, books and news in related subjects, suggested using machine learning.

References

  1. Awerbuch, B., Goldberg, A.V., Luby, M., Plotkin, S.: Network decomposition and locality in distributed computation. In: Proceedings of the 30th Symposium on Foundations of Computer Science, pp. 364–369 (1989)

  2. Andrews J., Jacobson M.: On a generalization of a chromatic number. Congr. Numer. 47, 33–48 (1985)

    MathSciNet  Google Scholar 

  3. Barenboim, L., Elkin, M.: Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. In: Proceedings of the 27th ACM Symposium on Principles of Distributed Computing, pp. 25–34 (2008)

  4. Barenboim, L., Elkin, M.: Distributed (Δ +  1)-coloring in linear (in Δ) time. In: Proceedings of the 41th ACM Symposium on Theory of Computing, pp. 111–120 (2009)

  5. Barenboim, L., Elkin, M.: Deterministic distributed vertex coloring in polylogarithmic time. In: Proceedings of the 29th ACM Symposium on Principles of Distributed Computing, pp. 410–419 (2010)

  6. Chudnovsky, M., Seymour, P.: The structure of claw-free graphs. Surveys in Combinatorics 2005, London Mathematical Society. Lecture Note Series, vol. 327, pp. 153–171 (2005)

  7. Cowen L., Cowen R., Woodall D.: Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valence. J. Graph Theory 10, 187–195 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  8. Cowen, L., Goddard, W., Jesurum, C.: Coloring with defect. In: Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms. New Orleans, Louisiana, USA, pp. 548–557 (1997)

  9. Czygrinow, A., Hanckowiak, M., Karonski, M.: Distributed O(Δlog n)-edge-coloring algorithm. In: Proceedings of the 9th Annual European Symposium on Algorithms, pp. 345–355 (2001)

  10. Dubhashi D., Grable D., Panconesi A.: Nearly-optimal, distributed edge-colouring via the nibble method. Theor. Comput. Sci. 203, 225–251 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  11. Durand, D., Jain, R., Tseytlin, D.: Applying randomized edge coloring algorithms to distributed communication: an experimental study. In: Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 264–274 (1995)

  12. Gfeller, B., Vicari, E.: A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs. In: Proceedings of the 26th ACM Symposium on Principles of Distributed Computing, pp. 53–60 (2007)

  13. Grable D., Panconesi A.: Nearly optimal distributed edge coloring in O(log log n) rounds. Random Struct. Algorithms 10(3), 385–405 (1998)

    Article  MathSciNet  Google Scholar 

  14. Harary F., Jones K.: Conditional colorability II: bipartite variations. Congr. Numer. 50, 205–218 (1985)

    MathSciNet  Google Scholar 

  15. Jain R., Somalwar K., Werth J., Browne J.C.: Scheduling parallel I/O operations in multiple bus systems. Elsevier J. Parallel Distrib. Comput. 16(4), 352–362 (1992)

    Article  MATH  Google Scholar 

  16. Kuhn, F., Moscibroda, T., Wattenhofer, R.: On the locality of bounded growth. In: Proceedings of the 24rd ACM Symposium on Principles of Distributed Computing, pp. 60–68 (2005)

  17. Kothapalli, K., Scheideler, C., Onus, M., Schindelhauer, C.: Distributed coloring in \({\tilde{O}(\sqrt{\log n})}\) bit rounds. In: Proceedings of the 20th International Parallel and Distributed Processing Symposium (2006)

  18. Kuhn, F.: Weak graph colorings: distributed algorithms and applications. In: Proceedings of the 21st ACM Symposium on Parallel Algorithms and Architectures, pp. 138–144 (2009)

  19. Linial N.: Locality in distributed graph algorithms. SIAM J. Comput. 21(1), 193–201 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  20. Linial N., Saks M.: Low diameter graph decomposition. Combinatorica 13, 441–454 (1993)

    Article  MathSciNet  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. Panconesi A., Srinivasan A.: On the complexity of distributed network decomposition. J. Algorithms 20(2), 581–592 (1995)

    MathSciNet  Google Scholar 

  23. Panconesi A., Srinivasan A.: Distibuted edge coloring via an extension of the Chernoff-Hoeffding bounds. SIAM J. Comput. 26(2), 350–368 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  24. Szegedy, M., Vishwanathan, S.: Locality based graph coloring. In: Proceedings of the 25th ACM Symposium on Theory of Computing, pp. 201–207 (1993)

  25. Schneider, J., Wattenhofer, R.: A log-star distributed maximal independent set algorithm for growth bounded graphs. In: Proceedings of the 27th ACM Symposium on Principles of Distributed Computing, pp. 35–44 (2008)

  26. Schneider, J., Wattenhofer, R.: A new technique for distributed symmetry breaking. In: Proceedings of the 29th ACM Symposium on Principles of Distributed Computing, pp. 257–266 (2010)

  27. Vizing V.G.: On an estimate of the chromatic class of a p-graph. Diskret Analiz 3, 25–30 (1964)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Ben-Gurion University of the Negev, POB 653, 84105, Beer-Sheva, Israel

    Leonid Barenboim & Michael Elkin

Authors
  1. Leonid Barenboim
    View author publications

    Search author on:PubMed Google Scholar

  2. Michael Elkin
    View author publications

    Search author on:PubMed Google Scholar

Corresponding author

Correspondence to Michael Elkin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Barenboim, L., Elkin, M. Distributed deterministic edge coloring using bounded neighborhood independence. Distrib. Comput. 26, 273–287 (2013). https://doi.org/10.1007/s00446-012-0167-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-012-0167-7

Keywords