Advertisement

On the Complexity of Distributed Greedy Coloring

  • Cyril Gavoille
  • Ralf Klasing
  • Adrian Kosowski
  • Alfredo Navarra
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4731)

Abstract

Distributed Greedy Coloring is an interesting and intuitive variation of the standard Coloring problem. It still consists in coloring in a distributed setting each node of a given graph in such a way that two adjacent nodes do not get the same color, but it adds a further constraint. Given an order among the colors, a coloring is said to be greedy if there does not exist a node for which its associated color can be replaced by a color of lower position in this order without violating the coloring property. We provide lower and upper bounds for this problem in Linial’s model and we relate them to other well-known problems, namely Coloring, Maximal Independent Set (MIS), and Largest First Coloring. Whereas the best known upper bound for Coloring, MIS, and Greedy Coloring are the same, we prove a lower bound which is strong in the sense that it now makes a difference between Greedy Coloring and MIS.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Battiti, R., Bertossi, A.A., Bonuccelli, M.A.: Assigning codes in wireless networks: bounds and scaling properties. Wireless networks 5(3), 195–209 (1999)CrossRefGoogle Scholar
  2. 2.
    Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21, 193–201 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Awerbuch, B., Goldberg, A.V., Luby, M., Plotkin, S.A.: Network decomposition and locality in distributed computation. In: FOCS, pp. 364–369. IEEE Computer Society Press, Los Alamitos (1989)Google Scholar
  4. 4.
    Panconesi, A., Srinivasan, A.: On the complexity of distributed network decomposition. J. Algorithms 20(2), 356–374 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Kuhn, F., Moscibroda, T., Wattenhofer, R.: What cannot be computed locally! In: Chaudhuri, S., Kutten, S. (eds.) PODC, pp. 300–309. ACM Press, New York (2004)CrossRefGoogle Scholar
  6. 6.
    Kosowski, A., Kuszner, Ł.: On greedy graph coloring in the distributed model. In: Nagel, W.E., Walter, W.V., Lehner, W. (eds.) Euro-Par 2006. LNCS, vol. 4128, pp. 592–601. Springer, Heidelberg (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Cyril Gavoille
    • 1
  • Ralf Klasing
    • 1
  • Adrian Kosowski
    • 2
  • Alfredo Navarra
    • 1
    • 3
  1. 1.LaBRI - Université Bordeaux - CNRS, 351 cours de la Liberation, 33405 TalenceFrance
  2. 2.Department of Algorithms and System Modeling, Gdańsk University of Technology, Narutowicza 11/12, 80952Poland
  3. 3.Dipartimento di Matematica e Informatica, Universitá degli Studi di Perugia, Via Vanvitelli 1, 06123 PerugiaItaly

Personalised recommendations