# Neighborhood graphs and distributed Δ+1-coloring

## Abstract

A tantalizing open question in the theory of distributed computing asks whether a graph with maximum degree Δ can be colored with Δ+1 colors in polylog deterministic steps in the distributed model of computation. Linial introduced the notion of a t-neighborhood graph of a given graph *G* and showed that the chromatic number of this graph is a lower bound on the number of colors that *G* can be colored with in *t* steps of the distributed model. In this paper we show that the chromatic number of any t-neighborhood graph is at most Δ + 1 for some t = *O*(log^{3}*n*). This implies that current techniques for proving lower bounds on the distributed complexity of Δ + 1-coloring are not strong enough to give a negative answer to the above open problem. The proof of this result is based on the analysis of a randomized algorithm for this problem using martingale inequalities. We also show that in a nonconstructive sense the Δ+1-coloring problem can be solved in polylog time for an infinite class of graphs including vertex-transitive graphs.

## Preview

Unable to display preview. Download preview PDF.

## References

- 1.N. Alon, L. Babai, A. Itai, A fast randomized parallel algorithm for the maximal independent set problem, J. Algorithms 7, pp. 567–583, 1986.Google Scholar
- 2.N. Alon and J.H. Spencer,
*The probabilistic method*, John Wiley & Sons, New York, 1992.Google Scholar - 3.B. Awerbuch, Complexity of network synchronization, JACM, 32:804–823, 1985.MathSciNetGoogle Scholar
- 4.B. Awerbuch, A.V. Goldberg, M. Luby and S.A. Plotkin, Network decomposition and locality in distributed computation, Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 364–369, 1989.Google Scholar
- 5.J.A. Bondy and U.S.R. Murty,
*Graph theory with applications*, North-Holland, 1976.Google Scholar - 6.R. Cole and U. Vishkin, Deterministic coin tossing with applications to optimal parallel list ranking, Inform, and Control, 70 (1986), pp. 32–56.Google Scholar
- 7.A.V. Goldberg, S. Plotkin and G.E. Shannon, Parallel symmetry-breaking in sparse graphs, SIAM J. Disc. Math, Vol. 1, No. 4, 1988.Google Scholar
- 8.N. Linial, Locality in distributed graph algorithms, SJC, 21:193–201, 1992.Google Scholar
- 9.M. Luby, Removing randomness in parallel computation without a processor penalty, JCSS, 47:250–286, 1993.Google Scholar
- 10.M. Luby,
*A simple parallel algorithm for the maximal independent set problem*, SIAM J. Computing, vol. 15, 1986, pp. 1036–1053.CrossRefGoogle Scholar - 11.M. Naor and L. Stockmeyer, What can be computed locally?, Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, 1993.Google Scholar
- 12.A. Panconesi and A. Srinivasan, Improved distributed algorithms for coloring and network decomposition problems, Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, 1992.Google Scholar
- 13.P. Raghavan, Probabilistic construction of deterministic algorithms: Approximating packing integer programs,
*J. Comput. System Sci.*, 37:130–143, 1988.Google Scholar - 14.M. Szegedy and S. Vishwanathan, Locality based graph coloring, Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, 1993.Google Scholar