Distributed (Δ + 1)-coloring in linear (in Δ) time

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 111-120

  Barenboim, Leonid ^a   Elkin, Michael ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Coloring; Defective coloring; Distributed algorithms

Indexed keywords

COLORING ALGORITHMS; COLORING PROBLEMS; DEFECTIVE-COLORING; DISTRIBUTED ALGORITHM; DISTRIBUTED ALGORITHMS; GRAPH COLORINGS; GRAPH G; ITERATIVE ALGORITHM; LONG LINE; LOWER BOUNDS; MAXIMUM DEGREE; PARAMETER T; RUNNING TIME; SUBGRAPHS;

COLOR; COMPUTATION THEORY; CONTROL THEORY; GRAPH THEORY; HEURISTIC ALGORITHMS; HEURISTIC METHODS; ITERATIVE METHODS; PARALLEL ALGORITHMS;

COLORING;

EID: 70350683794     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536432     Document Type: Conference Paper

References (29)

1. N. Alon, L. Babai, and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. Journal of Algorithms, 7(4):567-583, 1986.
2. J. Andrews, and M. Jacobson. On a generalization of a chromatic number. Congressus Numer, 47:33-48, 1985.
3. B. Awerbuch, A. V. Goldberg, M. Luby, and S. Plotkin. Network decomposition and locality in distributed computation. In Proc. of the 30th Symposium on Foundations of Computer Science, pages 364-369, 1989.
4. L. Barenboim, and M. Elkin. Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. In Proc. of the 27th ACM Symp. on Principles of Distributed Computing, pages 25-34, 2008.
5. R. Cole, and U. Vishkin. Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control, 70(1):32-53, 1986.
6. L. Cowen, R. Cowen, and D. Woodall. Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valence. Journal of Graph Theory, 10:187-195, 1986.
7. L. Cowen, W. Goddard, and C. Jesurum. Coloring with defect In Proc. of the 8th ACM-SIAM Symp. on Discrete Algorithms, pages 548-557, 1997.
8. P. Erdos, P. Frankl, and Z. Füuredi. Families of finite sets in which no set is covered by the union of r others. Israel Journal of Mathematics, 51:79-89, 1985.
9. M. Frick. A survey of (m; k)-colorings. Quo Vadis, Graph Theory?, volume 55 of Annals of Discrete Mathematics, pages 45-58, 1993.
10. B. Gfeller, and E. Vicari. A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs. In Proc. of the 26th ACM Symp. on Principles of Distributed Computing, pages 53-60, 2007
11. A. Goldberg, and S. Plotkin. Efficient parallel algorithms for (Δ + 1)- coloring and maximal independent set problem. In Proc. 19th ACM Symposium on Theory of Computing, pages 315-324, 1987.
12. A. Goldberg, S. Plotkin, and G. Shannon. Parallel symmetry-breaking in sparse graphs. SIAM Journal on Discrete Mathematics, 1(4):434-446, 1988.
13. F. Harary, and K. Jones. Conditional colorability II: Bipartite variations. Congressus Numer, 50:205-218, 1985.
14. Ö. Johansson. Simple distributed (Δ + 1)-coloring of graphs. Information Processing Letters, 70(5):229-232, 1999.
15. F. Kuhn. Determinstic distributed algorithms for weak colorings. Manuscript, February 2009.
16. F. Kuhn, T. Moscibroda, T. Nieberg, and R. Wattenhofer. Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. In 19th International Symposium on Distributed Computing, pages 273-287, 2005.
17. F. Kuhn, T. Moscibroda, and R. Wattenhofer. What cannot be ccomputed locally! In Proc. of the 23rd ACM Symp. on Principles of Distributed Computing, pages 300-309, 2004.
18. F. Kuhn, T. Moscibroda, and R. Wattenhofer. On the Locality of Bounded Growth. InProc. of the 24rd ACM Symp. on Principles of Distributed Computing, pages 60-68, 2005.
19. F. Kuhn, and R. Wattenhofer. On the complexity of distributed graph coloring. In Proc. of the 25th ACM Symp. on Principles of Distributed Computing, pages 7-15, 2006.
20. N. Linial. Distributive graph algorithms Global solutions from local data In Proc. of the 28th Annual Symp. on Foundation of Computer Science, pages 331-335, 1987.
21. N. Linial. Locality in distributed graph algorithms. SIAM Journal on Computing, 21(1):193-201, 1992.
22. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing, 15:1036-1053, 1986.
23. A. Mayer, M. Naor, and L. Stockmeryer. Local computations on static and dynamic graphs In Proc. of the 3rd Israel Symp. on the Theory of Computing and Systems, pages 268-278, 1995.
24. A. Panconesi, and R. Rizzi. Some Simple Distributed Algorithms for Sparse Networks. Distributed Computing, 14:97-100, 2001.
25. A. Panconesi, and A. Srinivasan. On the complexity of distributed network decomposition. Journal of Algorithms, 20(2):581-U592, 1995.
26. D. Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM, 2000.
27. S. Plotkin. Graph-Theoretic Techniques for Parallel, Distributed, and Sequential Computation. Doctoral thesis. MIT Cambridge lab for computer science, 1988.
28. J. Schneider, and R. Wattenhofer. A Log-Star Distributed Maximal Independent Set Algorithm For Growth Bounded Graphs. In Proc. of the 27th ACM Symp. on Principles of Distributed Computing, pages 35-44, 2008.
29. M. Szegedy, and S. Vishwanathan. Locality based graph coloring. In Proc. 25th ACM Symposium on Theory of Computing, pages 201-207, 1993.