Document Open Access Logo

On the Fine-Grained Complexity of Rainbow Coloring

Authors Lukasz Kowalik, Juho Lauri, Arkadiusz Socala

PDF
Thumbnail PDF

File

LIPIcs.ESA.2016.58.pdf
  • Filesize: 0.66 MB
  • 16 pages

Document Identifiers

Author Details

Lukasz Kowalik
Juho Lauri
Arkadiusz Socala

Cite As Get BibTex

Lukasz Kowalik, Juho Lauri, and Arkadiusz Socala. On the Fine-Grained Complexity of Rainbow Coloring. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 58:1-58:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016) https://doi.org/10.4230/LIPIcs.ESA.2016.58

Abstract

The Rainbow k-Coloring problem asks whether the edges of a given graph can be colored in k colors so that every pair of vertices is connected by a rainbow path, i.e., a path with all edges of different colors. Our main result states that for any k >= 2, there is no algorithm for Rainbow k-Coloring running in time 2^{o(n^{3/2})}, unless ETH fails. Motivated by this negative result we consider two parameterized variants of the problem. In the Subset Rainbow k-Coloring problem, introduced by Chakraborty et al. [STACS 2009, J. Comb. Opt. 2009], we are additionally given a set S of pairs of vertices and we ask if there is a coloring in which all the pairs in S are connected by rainbow paths. We show that Subset Rainbow k-Coloring is FPT when parameterized by |S|. We also study Subset Rainbow k-Coloring problem, where we are additionally given an integer q and we ask if there is a coloring in which at least q anti-edges are connected by rainbow paths. We show that the problem is FPT when parameterized by q and has a kernel of size O(q) for every k >= 2, extending the result of Ananth et al. [FSTTCS 2011]. We believe that our techniques used for the lower bounds may shed some light on the complexity of the classical Edge Coloring problem, where it is a major open question if a 2^{O(n)}-time algorithm exists.

Subject Classification

Keywords
  • graph coloring
  • computational complexity
  • lower bounds
  • exponential time hypothesis
  • FPT algorithms

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Prabhanjan Ananth, Meghana Nasre, and Kanthi K. Sarpatwar. Rainbow connectivity: Hardness and tractability. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011), pages 241-251, 2011. Google Scholar
  2. Yair Caro, Arie Lev, Yehuda Roditty, Zsolt Tuza, and Raphael Yuster. On rainbow connection. Electron. J. Combin, 15(1):R57, 2008. Google Scholar
  3. Sourav Chakraborty, Eldar Fischer, Arie Matsliah, and Raphael Yuster. Hardness and algorithms for rainbow connection. J. of Combinatorial Optimization, 21(3):330-347, 2009. Google Scholar
  4. L. Sunil Chandran and Deepak Rajendraprasad. Rainbow Colouring of Split and Threshold Graphs. Computing and Combinatorics, pages 181-192, 2012. Google Scholar
  5. L. Sunil Chandran and Deepak Rajendraprasad. Inapproximability of rainbow colouring. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013), pages 153-162, 2013. Google Scholar
  6. L. Sunil Chandran, Deepak Rajendraprasad, and Marek Tesař. Rainbow colouring of split graphs. Discrete Applied Mathematics, 2015. URL: http://dx.doi.org/10.1016/j.dam.2015.05.021.
  7. Gary Chartrand, Garry L. Johns, Kathleen A. McKeon, and Ping Zhang. Rainbow connection in graphs. Mathematica Bohemica, 133(1), 2008. Google Scholar
  8. Gary Chartrand and Ping Zhang. Chromatic graph theory. CRC press, 2008. Google Scholar
  9. Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, and Arkadiusz Socała. Tight bounds for graph homomorphism and subgraph isomorphism. In Proc. of the 27th Annual ACM-SIAM Symp. on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pages 1643-1649, 2016. Google Scholar
  10. Marek Cygan, Fedor V Fomin, Łukasz Kowalik, Dániel Lokshtanov, Daniel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer, 2015. Google Scholar
  11. Reinhard Diestel. Graph Theory. Springer-Verlag Heidelberg, 2010. Google Scholar
  12. Eduard Eiben, Robert Ganian, and Juho Lauri. On the complexity of rainbow coloring problems. In Proceedings of the Twenty-Sixth International Workshop on Combinatorial Algorithms, IWOCA 2015, Verona, Italy, October 5-7, pages 209-220, 2015. URL: http://arxiv.org/abs/1510.03614, URL: http://dx.doi.org/10.1007/978-3-319-29516-9_18.
  13. Michael Held and Richard M. Karp. A dynamic programming approach to sequencing problems. Journal of SIAM, 10:196-210, 1962. Google Scholar
  14. Russell Impagliazzo and Ramamohan Paturi. On the Complexity of k-SAT. J. Comput. Syst. Sci., 62(2):367-375, 2001. URL: http://dx.doi.org/10.1006/jcss.2000.1727.
  15. Russell Impagliazzo, Ramamohan Paturi, and Francis Zane. Which problems have strongly exponential complexity? J. Comput. Syst. Sci., 63(4):512-530, 2001. URL: http://dx.doi.org/10.1006/jcss.2001.1774.
  16. Stasys Jukna. On set intersection representations of graphs. Journal of Graph Theory, 61(1):55-75, 2009. URL: http://dx.doi.org/10.1002/jgt.20367.
  17. Lukasz Kowalik, Juho Lauri, and Arkadiusz Socala. On the fine-grained complexity of rainbow coloring. CoRR, abs/1602.05608, 2016. URL: http://arxiv.org/abs/1602.05608.
  18. Eugene L. Lawler. A note on the complexity of the chromatic number problem. Information Processing Letters, 5(3):66-67, 1976. Google Scholar
  19. Van Bang Le and Zsolt Tuza. Finding optimal rainbow connection is hard. Technical Report CS-03-09, Universität Rostock, 2009. Google Scholar
  20. Xueliang Li, Yongtang Shi, and Yuefang Sun. Rainbow Connections of Graphs: A Survey. Graphs and Combinatorics, 29(1):1-38, 2012. Google Scholar
  21. Arkadiusz Socała. Tight lower bound for the channel assignment problem. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pages 662-675, 2015. Google Scholar
  22. Craig A. Tovey. A simplified NP-complete satisfiability problem. Discrete Applied Mathematics, 8(1):85-89, 1984. URL: http://dx.doi.org/10.1016/0166-218X(84)90081-7.
  23. Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, and Xiao Zhou. On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. Algorithmica, 67(2):161-179, 2013. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact