Improved Distributed Algorithms for Coloring Interval Graphs with Application to Multicoloring Trees

  • Magnús M. Halldórsson
  • Christian KonradEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10641)


We give a distributed \((1+\epsilon )\)-approximation algorithm for the minimum vertex coloring problem on interval graphs, which runs in the \(\mathcal {LOCAL}\) model and operates in \(\mathrm {O}(\frac{1}{\epsilon } \log ^* n)\) rounds. If nodes are aware of their interval representations, then the algorithm can be adapted to the \(\mathcal {CONGEST}\) model using the same number of rounds. Prior to this work, only constant factor approximations using \(\mathrm {O}(\log ^* n)\) rounds were known [12]. Linial’s ring coloring lower bound implies that the dependency on \(\log ^* n\) cannot be improved. We further prove that the dependency on \(\frac{1}{\epsilon }\) is also optimal.

To obtain our \(\mathcal {CONGEST}\) model algorithm, we develop a color rotation technique that may be of independent interest. We demonstrate that color rotations can also be applied to obtain a \((1+\epsilon )\)-approximate multicoloring of directed trees in \(\mathrm {O}( \frac{1}{\epsilon } \log ^* n)\) rounds.


  1. 1.
    Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms 7(4), 567–583 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Barenboim, L.: Deterministic (\(\varDelta \) + 1)-coloring in sublinear (in \(\varDelta \)) time in static, dynamic, and faulty networks. J. ACM 63(5), 47:1–47:22 (2016). MathSciNetCrossRefGoogle Scholar
  3. 3.
    Barenboim, L., Elkin, M.: Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. Distrib. Comput. 22(5), 363–379 (2010)CrossRefzbMATHGoogle Scholar
  4. 4.
    Barenboim, L., Elkin, M.: Distributed graph coloring: fundamentals and recent developments. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers (2013).
  5. 5.
    Barenboim, L., Elkin, M., Gavoille, C.: A fast network-decomposition algorithm and its applications to constant-time distributed computation. In: Scheideler, C. (ed.) Structural Information and Communication Complexity. LNCS, vol. 9439, pp. 209–223. Springer, Cham (2015). CrossRefGoogle Scholar
  6. 6.
    Barenboim, L., Elkin, M., Pettie, S., Schneider, J.: The locality of distributed symmetry breaking. J. ACM 63(3), 20:1–20:45 (2016). MathSciNetCrossRefGoogle Scholar
  7. 7.
    Bollobás, B.: Chromatic number, girth and maximal degree. Discrete Math. 24(3), 311–314 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Chang, Y.J., Kopelowitz, T., Pettie, S.: An exponential separation between randomized and deterministic complexity in the local model. In: Proceedings 57th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 615–624 (2016)Google Scholar
  9. 9.
    Cole, R., Vishkin, U.: Deterministic coin tossing with applications to optimal parallel list ranking. Inf. Control 70(1), 32–53 (1986). MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Fraigniaud, P., Heinrich, M., Kosowski, A.: Local conflict coloring. In: IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, 9–11 October 2016. Hyatt Regency, New Brunswick, New Jersey, USA, pp. 625–634 (2016).
  11. 11.
    Goldberg, A.V., Plotkin, S.A., Shannon, G.E.: Parallel symmetry-breaking in sparse graphs. SIAM J. Discrete Math. 1(4), 434–446 (1988). MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Halldórsson, M.M., Konrad, C.: Distributed algorithms for coloring interval graphs. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 454–468. Springer, Heidelberg (2014). Google Scholar
  13. 13.
    Harris, D.G., Schneider, J., Su, H.H.: Distributed (&#1)-coloring in sublogarithmic rounds. In: Proceedings of the Forty-eighth Annual ACM Symposium on Theory of Computing, STOC 2016, pp. 465–478. ACM, New York (2016).
  14. 14.
    Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, NewYork (1972)CrossRefGoogle Scholar
  15. 15.
    Kuhn, F.: Local multicoloring algorithms: computing a nearly-optimal TDMA schedule in constant time. In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, 26–28 February 2009, Freiburg, Germany, Proceedings, pp. 613–624 (2009).
  16. 16.
    Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21(1), 193–201 (1992). MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Luby, M.: A simple parallel algorithm for the maximal independent set problem. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, STOC 1985, pp. 1–10. ACM, New York (1985).
  18. 18.
    Schneider, J., Elkin, M., Wattenhofer, R.: Symmetry breaking depending on the chromatic number or the neighborhood growth. Theor. Comput. Sci. 509, 40–50 (2013). MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Schneider, J., Wattenhofer, R.: An optimal maximal independent set algorithm for bounded-independence graphs. Distrib. Comput. 22, 349–361 (2010)CrossRefzbMATHGoogle Scholar
  20. 20.
    Schneider, J., Wattenhofer, R.: A new technique for distributed symmetry breaking. In: Proceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010, pp. 257–266. ACM, New York (2010).
  21. 21.
    Smith, D.A.: The first-fit algorithm uses many colors on some interval graphs. Ph.D. thesis, Arizona State University, Tempe, AZ, USA (2010). aAI3428197Google Scholar
  22. 22.
    Valencia-Pabon, M.: Revisiting Tucker’s algorithm to color circular arc graphs. SIAM J. Comput. 32(4), 1067–1072 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory Comput. 3(1), 103–128 (2007)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.ICE-TCS, School of Computer ScienceReykjavik UniversityReykjavikIceland
  2. 2.Department of Computer Science, Centre for Discrete Mathematics and its Applications (DIMAP)University of WarwickCoventryUK

Personalised recommendations