Fast Distributed Algorithms for Brooks-Vizing Colorings

Journal of Algorithms

Volumn 37, Issue 1, 2000, Pages 85-120

  Grable, David A ^a   Panconesi, Alessandro ^b  

^a HUMBOLDT UNIVERSITY   (Germany)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0348000562     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1097     Document Type: Article

References (25)

1. B. Awerbuch, A. V. Goldberg, M. Luby, and S. Plotkin, Network decomposition and locality in distributed computing, in "Proceedings of the 30th Symposium on Foundations of Computer Science (FOCS 1989)," pp. 364-369, IEEE, Research Triangle Park, North Carolina.
2. N. Alon, J. H. Kim, and J. Spencer, Nearly perfect matchings in regular simple hypergraphs, Israel J. Math. 100 (1997), 171-187.
3. N. Alon, J. Spencer, and P. Erdos, "The Probabilistic Method," Wiley-Interscience, New York, 1992.
4. B. Bollobás, "Graph Theory," Springer-Verlag, New York, 1979.
5. B. Bollobás, Chromatic number, girth, and maximal degree, Discrete Math. 24 (1978), 311-314.
6. S. Chaudhuri and D. Dubhashi, Probabilistic recurrence relations revisited, Theoret. Comput. Sci., to appear.
7. D. Dubhas∼i, D. A. Grable, and A. Panconesi, Nearly-optimal, distributed edge-coloring via the nibble method, Theoret. Comp. Sci. 203 (1998), 225-251. [A special issue for ESA95, the 3rd European Symposium on Algorithms (ESA 95)]
8. D. Dubhashi and A. Panconesi, "Concentration of Measure for Computer Scientists," draft available at http://www.cs.unibo.it/∼pancones/papers.html.
9. D. A. Grable, A large deviation inequality for functions of independent, multi-way choices, Combin. Probab. Comput. Nr. 7 (1998), 57-64.
10. D. A. Grable, On random greedy triangle packing, Electronic J. Combinatorics 4 (1997), R11, 19.
11. D. A. Grable and A. Panconesi, Nearly optimal distributed edge coloring in O(log log n) rounds, Random Structures and Algorithms 10 (1997), 385-405. [Extended Abstract in Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 97), pp. 278-285, New Orleans.]
12. D. A. Grable and A. Panconesi, Nearly optimal distributed edge coloring in O(log log n) rounds, Random Structures and Algorithms 10 (1997), 385-405. [Extended Abstract in Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 97), pp. 278-285, New Orleans.]
13. P. Hajnal and E. Szemerédi, Brooks' coloring in parallel, SIAM J. Discrete Math. 3 (1990), 74-80.
14. A. R. Johansson, Asymptotic choice number for triangle-free graphs, preprint, DIMACS, September 30, 1996.
15. O. Johansson, Simple distributed A + 1-coloring of graphs, Inform. Process. Lett., 70(5) (1999), 229-232.
16. N. Karchmer and J. Naor, A faster parallel algorithm to color a graph with Δ colors, J. Algorithms 9 (1988), 83-91.
17. H. J. Karloff, An NC-algorithm for Brooks' theorem, Theoret. Comput. Sci. 68 (1989), 89-103.
18. R. M. Karp, Probabilistic recurrence relations, in "Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC 91), New Orleans," pp. 190-197.
19. J. H. Kim, On Brooks' theorem for sparse graphs, Combin. Probab. Comput. 4 (1995), 97-132.
20. M. Luby, Removing randomness in parallel without processor penalty, J. Comput. System Sci. 47 (1993), 250-286.
21. C. McDiarmid, On the method of bounded differences, in "Surveys in Combinatorics" (J. Siemens, Ed.), London Mathematical Society Lecture Notes Series, Vol, 141, pp. 148-188, 1989.
22. R. Motwani and P. Raghavan, "Randomized Algorithms," Cambridge Univ. Press, Cambridge, UK, 1995.
23. A. Panconesi and A. Srinivasan, The local nature of Δ-coloring and its algorithmic applications, Combinatorica 15 (1995), 255-280.
24. A. Panconesi and A. Srinivasan, On the complexity of distributed network decomposition, J. Algorithms 20 (1996), 356-374.
25. J. M. Steele, Probability theory and combinatorial optimization, in "CBMS-NSF 69 of Regional Conference Series in Applied Mathematics," SIAM, Philadelphia.