On Directed Feedback Vertex Set Parameterized by Treewidth

  • Marthe Bonamy
  • Łukasz Kowalik
  • Jesper Nederlof
  • Michał Pilipczuk
  • Arkadiusz Socała
  • Marcin WrochnaEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11159)


We study the Directed Feedback Vertex Set problem parameterized by the treewidth of the input graph. We prove that unless the Exponential Time Hypothesis fails, the problem cannot be solved in time \(2^{o(t\log t)}\cdot n^{\mathcal {O}(1)}\) on general directed graphs, where t is the treewidth of the underlying undirected graph. This is matched by a dynamic programming algorithm with running time \(2^{\mathcal {O}(t\log t)}\cdot n^{\mathcal {O}(1)}\). On the other hand, we show that if the input digraph is planar, then the running time can be improved to \(2^{\mathcal {O}(t)}\cdot n^{\mathcal {O}(1)}\).


  1. 1.
    Bonamy, M., Kowalik, L., Nederlof, J., Pilipczuk, M., Socała, A., Wrochna, M.: On directed feedback vertex set parameterized by treewidth. arXiv abs/1707.01470 (2017)Google Scholar
  2. 2.
    Chen, J., Liu, Y., Lu, S., O’Sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM 55(5), 21:1–21:19 (2008)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Chitnis, R.H., Cygan, M., Hajiaghayi, M.T., Marx, D.: Directed subset feedback vertex set is fixed-parameter tractable. ACM Trans. Algorithms 11(4), 28:1–28:28 (2015)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Chitnis, R.H., Hajiaghayi, M., Marx, D.: Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset. SIAM J. Comput. 42(4), 1674–1696 (2013)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). Scholar
  6. 6.
    Dorn, F., Penninkx, E., Bodlaender, H.L., Fomin, F.V.: Efficient exact algorithms on planar graphs: exploiting sphere cut decompositions. Algorithmica 58(3), 790–810 (2010)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Fomin, F.V., Thilikos, D.M.: New upper bounds on the decomposability of planar graphs. J. Graph Theory 51(1), 53–81 (2006)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Gyárfás, A.: On the chromatic number of multiple interval graphs and overlap graphs. Discret. Math. 55(2), 161–166 (1985)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Gyárfás, A.: Corrigendum: on the chromatic number of multiple interval graphs and overlap graphs. Discret. Math. 62(3), 333 (1986)CrossRefGoogle Scholar
  10. 10.
    Gyárfás, A.: Problems from the world surrounding perfect graphs. Applicationes Mathematicae 19(3–4), 413–441 (1987)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Kim, E.J., Gonçalves, D.: On exact algorithms for the permutation CSP. Theor. Comput. Sci. 511, 109–116 (2013)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Kratsch, S., Pilipczuk, M., Pilipczuk, M., Wahlström, M.: Fixed-parameter tractability of Multicut in directed acyclic graphs. SIAM J. Discret. Math. 29(1), 122–144 (2015)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Kratsch, S., Wahlström, M.: Representative sets and irrelevant vertices: new tools for kernelization. In: FOCS 2012, pp. 450–459. IEEE Computer Society (2012)Google Scholar
  14. 14.
    Lokshtanov, D., Marx, D., Saurabh, S.: Slightly superexponential parameterized problems. In: SODA vol. 2011, pp. 760–776 (2011)Google Scholar
  15. 15.
    Lokshtanov, D., Ramanujan, M.S., Saurabh, S.: A linear time parameterized algorithm for directed feedback vertex set. CoRR abs/1609.04347 (2016)Google Scholar
  16. 16.
    Lovász, L.: On two minimax theorems in graph. J. Comb. Theory, Ser. B 21(2), 96–103 (1976)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Lucchesi, C.L., Younger, D.H.: A minimax theorem for directed graphs. J. London Math. Soc 17, 369–374 (1978)MathSciNetCrossRefGoogle Scholar
  18. 18.
    Pilipczuk, M., Wahlström, M.: Directed multicut is \({W}[1]\)-hard, even for four terminal pairs. In: SODA 2016, pp. 1167–1178. SIAM (2016)Google Scholar
  19. 19.
    Schrijver, A.: Combinatorial Optimization - Polyhedra and Efficiency. Springer, Heidelberg (2003)zbMATHGoogle Scholar
  20. 20.
    Seymour, P.D., Thomas, R.: Call routing and the ratcatcher. Combinatorica 14(2), 217–241 (1994)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Marthe Bonamy
    • 1
  • Łukasz Kowalik
    • 2
  • Jesper Nederlof
    • 3
  • Michał Pilipczuk
    • 2
  • Arkadiusz Socała
    • 2
  • Marcin Wrochna
    • 2
    Email author
  1. 1.CNRS, LaBRITalenceFrance
  2. 2.Institute of InformaticsUniversity of WarsawWarsawPoland
  3. 3.Eindhoven University of TechnologyEindhovenNetherlands

Personalised recommendations