Combinatorial Algorithms for Distributed Graph Coloring

  • Leonid Barenboim
  • Michael Elkin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6950)

Abstract

Numerous problems in Theoretical Computer Science can be solved very efficiently using powerful algebraic constructions. Computing shortest paths, constructing expanders, and proving the PCP Theorem, are just a few examples of this phenomenon. The quest for combinatorial algorithms that do not use heavy algebraic machinery, but have the same (or better) efficiency has become a central field of study in this area. Combinatorial algorithms are often simpler than their algebraic counterparts. Moreover, in many cases, combinatorial algorithms and proofs provide additional understanding of studied problems. In this paper we initiate the study of combinatorial algorithms for Distributed Graph Coloring problems. In a distributed setting a communication network is modeled by a graph G = (V,E) of maximum degree Δ. The vertices of G host the processors, and communication is performed over the edges of G. The goal of distributed vertex coloring is to color V with (Δ + 1) colors such that any two neighbors are colored with distinct colors. Currently, efficient algorithms for vertex coloring that require O(Δ + log*n) time are based on the algebraic algorithm of Linial [18] that employs set-systems. The best currently-known combinatorial set-system free algorithm, due to Goldberg, Plotkin, and Shannon [14], requires O2 + log*n) time. We significantly improve over this by devising a combinatorial (Δ + 1)-coloring algorithm that runs in O(Δ + log*n) time. This exactly matches the running time of the best-known algebraic algorithm. In addition, we devise a tradeoff for computing O(Δ·t)-coloring in O(Δ/t + log*n) time, for almost the entire range 1 < t < Δ. We also compute a Maximal Independent Set in O(Δ + log*n) time on general graphs, and in O(logn/ loglogn) time on graphs of bounded arboricity. Prior to our work, these results could be only achieved using algebraic techniques. We believe that our algorithms are more suitable for real-life networks with limited resources, such as sensor, ad-hoc, and mobile networks.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alon, N.: Eigen-values and expanders. Combinatorica 6(2), 83–96 (1986)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms 7(4), 567–583 (1986)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Arora, S., Safra, S.: Probabilistic Checking of Proofs: A New Characterization of NP. Journal of the ACM 45(1), 70–122 (1998)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Awerbuch, B., Goldberg, A.V., Luby, M., Plotkin, S.: Network decomposition and locality in distributed computation. In: Proc. of the 30th IEEE Annual Symposium on Foundations of Computer Science, pp. 364–369 (October 1989)Google Scholar
  5. 5.
    Barenboim, L., Elkin, M.: Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. In: Proc. of the 27th ACM Symp. on Principles of Distributed Computing, pp. 25–34 (2008)Google Scholar
  6. 6.
    Barenboim, L., Elkin, M.: Distributed (Δ + 1)-coloring in linear (in Δ) time. In: Proc. of the 41th ACM Symp. on Theory of Computing, pp. 111–120 (2009), http://arXiv.org/abs/0812.1379v2 (2008)
  7. 7.
    Barenboim, L., Elkin, M.: Deterministic distributed vertex coloring in polylogarithmic time. In: Proc. of the 29th ACM Symp. on Principles of Distributed Computing, pp. 410–419 (2010)Google Scholar
  8. 8.
    Ben-Aroya, A., Ta-Shma, A.: A combinatorial construction of almost-Ramanujan graphs using the zig-zag product. In: Proc. of the 40th ACM Symp. on Theory of Computing, pp. 325–334 (2008)Google Scholar
  9. 9.
    Cole, R., Vishkin, U.: Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control 70(1), 32–53 (1986)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Dinur, I., Reingold, O.: Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem. SIAM Journal on Computing 36(4), 975–1024 (2006)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Erdős, P., Frankl, P., Füredi, Z.: Families of finite sets in which no set is covered by the union of r others. Israel Journal of Mathematics 51, 79–89 (1985)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Feige, U., Goldwasser, S., Lovasz, L., Safra, S., Szegedy, M.: Interactive proofs and the hardness of approximating cliques. JACM 43(2), 268–292 (1996)MathSciNetCrossRefMATHGoogle Scholar
  13. 13.
    Goldberg, A., Plotkin, S.: Efficient parallel algorithms for (Δ + 1) - coloring and maximal independent set problem. In: Proc. 19th ACM Symposium on Theory of Computing, pp. 315–324 (1987)Google Scholar
  14. 14.
    Goldberg, A., Plotkin, S., Shannon, G.: Parallel symmetry-breaking in sparse graphs. SIAM Journal on Discrete Mathematics 1(4), 434–446 (1988)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Kothapalli, K., Scheideler, C., Onus, M., Schindelhauer, C.: Distributed coloring in \(\tilde{O}(\sqrt{\log n})\) bit rounds. In: 20th International Parallel and Distributed Processing Symposium (2006)Google Scholar
  16. 16.
    Kuhn, F.: Weak graph colorings: distributed algorithms and applications. In: Proc. 21st ACM Symp. on Parallel Algorithms and Architectures, pp. 138–144 (2009)Google Scholar
  17. 17.
    Kuhn, F., Wattenhofer, R.: On the complexity of distributed graph coloring. In: Proc. of the 25th ACM Symp. on Principles of Distributed Computing, pp. 7–15 (2006)Google Scholar
  18. 18.
    Linial, N.: Locality in distributed graph algorithms. SIAM Journal on Computing 21(1), 193–201 (1992)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Lubotzky, A., Philips, R., Sarnak, P.: Ramanujan graphs. Combinatorica 8, 261–277 (1988)MathSciNetCrossRefMATHGoogle Scholar
  20. 20.
    Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing 15, 1036–1053 (1986)MathSciNetCrossRefMATHGoogle Scholar
  21. 21.
    Meir, O.: Combinatorial PCPs with Efficient Verifiers. In: Proc. of the 50th Annual IEEE Symp. on Foundations of Computer Science, pp. 463–471 (2009)Google Scholar
  22. 22.
    Panconesi, A., Rizzi, R.: Some simple distributed algorithms for sparse networks. Distributed Computing 14(2), 97–100 (2001)CrossRefGoogle Scholar
  23. 23.
    Panconesi, A., Srinivasan, A.: On the complexity of distributed network decomposition. Journal of Algorithms 20(2), 581–592 (1995)MathSciNetGoogle Scholar
  24. 24.
    Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM, Philadelphia (2000)CrossRefMATHGoogle Scholar
  25. 25.
    Reingold, O.: Undirected ST-connectivity in log-space. In: Proc. of the 37th ACM Symp. on Theory of Computing, pp. 376–385 (2005)Google Scholar
  26. 26.
    Reingold, O., Vadhan, S., Wigderson, A.: Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. In: Proc. of the 41st Annual IEEE Symp. on Foundations of Computer Science, pp. 3–13 (2000)Google Scholar
  27. 27.
    Schneider, J., Wattenhofer, R.: A New Technique For Distributed Symmetry Breaking. In: Proc. of the 29th ACM Symp. on Principles of Distributed Computing, pp. 257–266 (2010)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Leonid Barenboim
    • 1
  • Michael Elkin
    • 1
  1. 1.Department of Computer ScienceBen-Gurion University of the NegevBeer-ShevaIsrael

Personalised recommendations