Deterministic distributed vertex coloring in polylogarithmic time

Journal of the ACM

Volumn 58, Issue 5, 2011, Pages

  Barenboim, Leonid ^a   Elkin, Michael ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Arbdefective coloring; Arboricity; Partial orientation

Indexed keywords

ARBORICITY; DETERMINISTIC ALGORITHMS; HIGH PROBABILITY; N-VERTEX GRAPH; PARTIAL ORIENTATION; POLYLOGARITHMIC TIME; RANDOMIZED ALGORITHMS; RUNNING TIME; VERTEX COLORING; VERTEX COLORING PROBLEMS;

ALGORITHMS; COLOR; COLORING; COMMUNICATION;

GRAPH THEORY;

EID: 81355150930     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/2027216.2027221     Document Type: Conference Paper

References (24)

1. ALON, N., BABAI, L., AND ITAI, A. 1986. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms 7(4), 567-583.
2. AWERBUCH, B., GOLDBERG, A. V., LUBY, M., AND PLOTKIN, S. 1989. Network decomposition and locality in distributed computation. In Proceedings of the 30th Symposium on Foundations of Computer Science. 364-369. (Pubitemid 20725973)
3. BARENBOIM, L. AND ELKIN, M. 2008a. Distributed (Δ + 1)-coloring in linear (in Δ) time. http://arXiv.org/abs/0812.1379v2.
4. BARENBOIM, L. AND ELKIN, M. 2008b. Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. In Proceedings of the 27th ACM Symposium on Principles of Distributed Computing. 25-34.
5. BARENBOIM, L. AND ELKIN, M. 2009. Distributed (Δ + 1)-coloring in linear (in Δ) time. In Proceedings of the 41th ACM Symposium on Theory of Computing. 111-120.
6. COLE, R. AND VISHKIN, U. 1986. Deterministic coin tossing with applications to optimal parallel list ranking. Info. Cont. 70(1), 32-53. (Pubitemid 17511516)
7. COWEN, L. C. R. AND WOODALL, D. 1986. Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valence. J. Graph Theory 10, 187-195.
8. EPPSTEIN, D. 1994. Arboricity and bipartite subgraph listing algorithms. Inf. Proc. Lett. 51(4), 207-211. (Pubitemid 124013192)
9. GALLAI, T. 1968. On directed paths and circuits. Theory of Graphs, Academic Press, 115-118.
10. GOLDBERG, A. AND PLOTKIN, S. 1987. Efficient parallel algorithms for (Δ + 1)- coloring and maximal independent set problem. In Proceedings of the 19th ACM Symposium on Theory of Computing. 315-324.
11. GOLDBERG, A., PLOTKIN, S., AND SHANNON, G. 1988. Parallel symmetry-breaking in sparse graphs. SIAM J. Discr. Math. 1(4), 434-446.
12. HARARY, F. AND JONES, K. 1985. Conditional colorability ii: Bipartite variations. Congressus Numer 50, 205-218.
13. KOTHAPALLI, K., SCHEIDELER, C., ONUS, M., AND SCHINDELHAUER, C. 2006. Distributed coloring in Õ (√log n) bit rounds. In Proceedings of the 20th International Parallel and Distributed Processing Symposium.
14. KUHN, F. 2009. Weak graph colorings: distributed algorithms and applications. In Proceedings of the 21st ACM Symposium on Parallel Algorithms and Architectures. 138-144.
15. KUHN, F. AND WATTENHOFER, R. 2006. On the complexity of distributed graph coloring. In Proceedings of the 25th ACM Symposium on Principles of Distributed Computing. 7-15. (Pubitemid 44393688)
16. LINIAL, N. 1987. Distributive graph algorithms: Global solutions from local data. In Proceedings of the 28th Annual Symposium on Foundation of Computer Science. 331-335. (Pubitemid 18538612)
17. LINIAL, N. 1992. Locality in distributed graph algorithms. SIAM J. Comput. 21, 1, 193-201.
18. LINIAL, N. AND SAKS, M. 1993. Low diameter graph decomposition. Combinatorica 13, 441-454.
19. LUBY, M. 1986. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15, 1036-1053. (Pubitemid 17465853)
20. PANCONESI, A. AND SRINIVASAN, A. 1995. On the complexity of distributed network decomposition. J. Algorithms 20, 2, 581-592.
21. PELEG, D. 2000. Distributed Computing: A Locality-Sensitive Approach. SIAM.
22. ROY, B. 1967. Nombre chromatique et plus longs chemins d'un graphe. Rev. Francaise Automat. Informat. Recherche Operationelle Ser. Rouge 1, 127-132.
23. SCHNEIDER, J. AND WATTENHOFER, R. 2010. A new technique for distributed symmetry breaking. In Proceedings of the 29th ACM Symposium on Principles of Distributed Computing. 257-266.
24. SZEGEDY, M. AND VISHWANATHAN, S. 1993. Locality based graph coloring. In Proceedings of the 25th ACM Symposium on Theory of Computing. 201-207. (Pubitemid 23668778)