Weak graph colorings: Distributed algorithms and applications

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2009, Pages 138-144

  Kuhn, Fabian ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Deterministic symmetry breaking; Distributed algorithms; Graph coloring; Locality

Indexed keywords

COLORING ALGORITHMS; DETERMINISTIC ALGORITHMS; DISTRIBUTED ALGORITHM; GRAPH COLORING PROBLEM; GRAPH COLORINGS; MAXIMAL INDEPENDENT SET; MAXIMUM DEGREE; NETWORK GRAPH; REQUIRED TIME; SYMMETRY-BREAKING; VERTEX COLORING PROBLEMS;

GRAPH THEORY; PARALLEL ALGORITHMS;

COLORING;

EID: 70449659541     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1583991.1584032     Document Type: Conference Paper

References (25)

1. J. Andrews and M. Jacobson. On a generalization of chromatic number. Congressus Numerantium, 47:33-48, 1985.
2. B. Awerbuch. Complexity of network synchronization. Journal of the ACM, 32(4):804-823, 1985.
3. B. Awerbuch, A. V. Goldberg, M. Luby, and S. A. Plotkin. Network decomposition and locality in distributed computation. In Proc. of 30th Symposium on Foundations of Computer Science (FOCS), pages 364-369, 1989.
4. L. Barenboim and M. Elkin. Sublogarithmic distributed mis algorithm for sparse graphs using nash-williams decomposition. In Proc. of 27th ACM Symposium on Principles of Distributed Computing (PODC), 2008.
5. L. Barenboim and M. Elkin. Distributed (Δ + 1)-coloring in linear (in Δ) time. In Proc. of the 41st ACM Symposium on Theory of Computing (STOC), 2009.
6. R. Cole and U. Vishkin. Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control, 70(1):32-53, 1986.
7. 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.
8. L. Cowen, W. Goddard, and C. Jesurum. Defective coloring revisitied. Journal of Graph Theory, 24(3):205-219, 1997.
9. G. De Marco and A. Pelc. Fast distributed graph coloring with O(Δ) colors. In Proc. of 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 630-635, 2001.
10. P. Erdocombining double acute accents, P. Frankl, and Z. Füredi. Families of finite sets in which no set is covered by the union of r others. Israel Journal of Mathematics, 51:79-89, 1985.
11. M. Frick. A survery of (m, k)-colorings. Annals of Discrete Mathematics, 55:45-58, 1993.
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 Numerantium, 50:205-218, 1985.
14. K. Kothapalli, M. Onus, C. Scheideler, and C. Schindelhauer. Distributed coloring in o(√log n) bit rounds. In Proc. of 20th IEEE Int. Parallel and Distributed Processing Symposium (IPDPS), 2006.
15. F. Kuhn. Local multicoloring algorithms: Computing a nearly-optimal TDMA schedule in constant time. In Proc. of 26th Symp. on Theoretical Aspects of Computer Science (STACS), 2009.
16. F. Kuhn and R. Wattenhofer. On the complexity of distributed graph coloring. In Proc. of 25th ACM Symposium on Principles of Distributed Computing (PODC), pages 7-15, 2006.
17. N. Linial. Locality in distributed graph algorithms. SIAM Journal on Computing, 21(1):193-201, 1992.
18. L. Lovász. On decompositions of graphs. Studia Sci. Math. Hungar., 1:237-238, 1966.
19. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing, 15:1036-1053, 1986.
20. M. Naor and L. Stockmeyer. What can be computed locally? In Proc. of 25th ACM Symposium on Theory of Computing (STOC), pages 184-193, 1993.
21. A. Panconesi and A. Srinivasan. On the complexity of distributed network decomposition. Journal of Algorithms, 20(2):581-592, 1995.
22. A. Pelc. Personal communication.
23. J. Schneider and R. Wattenhofer. A log-star distributed maximal independent set algorithm for growth-bounded graphs. In Proc. of 27th ACM Symposium on Principles of Distributed Computing (PODC), 2008.
24. M. Szegedy and S. Vishwanathan. Locality based graph coloring. In Proc. of the 25th ACM Symposium on Theory of Computing (STOC), pages 201-207, 1993.
25. D. Woodall. Improper colourings of graphs. In R. Nelson and R. Wilson, editors, Graph Colourings. Longman Scientific and Technical, 1990.