Nearly optimal distributed edge coloring in O(log log n) rounds

Random Structures and Algorithms

Volumn 10, Issue 3, 1997, Pages 385-405

  Grable, David A ^a   Panconesi, Alessandro ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031481094     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199705)10:3<385::AID-RSA6>3.0.CO;2-S     Document Type: Article

References (27)

1. N. Alon, personal communications.
2. N. Alon, J. Spencer, and P. Erdos, The Probabilistic Method, Wiley-Interscience, New York, 1992.
3. N. Alon, J. H. Kim, and J. Spencer, Nearly perfect matchings in regular simple hypergraphs, preprint, 1995.
4. B. Awerbuch, A. V. Goldberg, M. Luby, and S. A. Plotkin, Network decomposition and locality in distributed computation, Proc. IEEE 30th Symp. Found. of Comput. Sci., 1989, pp. 364-369.
5. cn)-wise independence in NC. J. ACM 38(4), 1026-1046 (1991).
6. B. Bollobás, Graph Theory, Springer Verlag, New York, 1979.
7. D. Dubhashi and A. Panconesi, Near-optimal distributed edge coloring, Proc. 3rd Annual European Symposium on Algorithms, 1995, Springer-Verlag, New York, LNCS 979, pp. 448-459.
8. D. Durand, R. Jain, and D. Tseytlin, Distributed scheduling algorithms to improve the performance of parallel data transfers, Tech. Report 94-38, DIMACS, 1994.
9. Z. Galil and D. Leven, NP-completeness of finding the chromatic index of regular graphs, J. Alg., 4, 35-44 (1983).
10. D. A. Grable, A large deviation inequality for functions of independent, multi-way choices, Combinat. Probab. Comput., to appear.
11. I. Holyer, The NP-completeness of edge coloring, SIAM J. Comput., 10, 718-720 (1981).
12. R. Jain, K. Somalwar, J. Werth, and J. C. Browne, Scheduling parallel I/O operations in multiple bus systems, J. Parallel Distributed Comput., 16(4), 352-362 (1992).
13. J. Kahn, Asymptotically good list-colorings, J. Combinat. Theor. Ser. A, 73, 1-59 (1996).
14. H. J. Karloff and D. B. Shmoys, Efficient parallel algorithms for edge coloring problems, J. Alg., 8, 39-52 (1987).
15. J. H. Kim, On Brooks' theorem for sparse graphs, Combinat. Probab. Comput., 4, 97-132 (1995).
16. 2/log t, Random Struct. Alg., 7, 173-208 (1995).
17. G. F. Lev, N. Pippenger, and L. G. Valiant, A fast parallel algorithm for routing in permutation networks, IEEE Trans. Comput., 30, 93-100 (1981).
18. N. Linial and M. Saks, Decomposing graphs into regions of small diameter, Proc. 3rd ACM/SIAM Symposium on Discrete Algorithms, 1991, pp. 320-330.
19. M. Luby, A simple parallel algorithm for the maximal independent set problem, SIAM J. Comput., 15(4), 1036-1053 (1986).
20. N. A. Lynch, Upper bounds for static resource allocation in a distributed system, J. Comput. Syst. Sci., 23, 254-278 (1981).
21. C. McDiarmid, On the method of bounded differences, in Surveys in Combinatorics, J. Siemons Ed. Lecture Note Series 141, London Math. Society, London, 1989, pp. 148-188.
22. R. Motwani, J. Naor, and M. Naor, The probabilistic method yields deterministic parallel algorithms, J. Comput. Sci., 49, 478-516 (1994).
23. A. Panconesi and A. Srinivasan, On the complexity of distributed network decomposition, J. Alg., 20, 356-374 (1996).
24. A. Panconesi and A. Srinivasan, Fast randomized algorithms for distributed edge coloring, Proc. ACM Symp. Principles of Distributed Computing, 1992, pp. 251-262, to appear in SIAM J. Comput.
25. A. Panconesi and A. Srinivasan, The local nature of Δ-coloring and its algorithmic applications, Combinatorica, 15(2), 255-280 (1995).
26. N. Pippenger and J. Spencer, Asymptotic behavior of the chromatic index for hypergraphs, J. Combinat. Theor. Ser. A, 51, 24-42 (1989).
27. V. Rödl, On a packing and covering problem, Eur. J. Combinat., 5, 69-78 (1985).