Skip to main content

On Directed Feedback Vertex Set Parameterized by Treewidth

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 2018)


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)}\).

Work supported by the National Science Centre of Poland, grant number 2013/11/D/ST6/03073 (MP, MW). The work of Ł. Kowalik is a part of the project TOTAL that has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 677651). This research is a part of projects that have received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreements No 714704 (AS). MP and MW are supported by the Foundation for Polish Science (FNP) via the START stipend programme. JN is supported by NWO Veni grant 639.021.438.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions


  1. 1.

    In general digraphs, DFVS and DFAS are well-known to be reducible to each other; see [5, Proposition 8.42 and Exercise 8.16]. These reductions, however, do not preserve planarity of the digraph in question.

  2. 2.

    Throughout this paper, the treewidth of a directed graph is defined as the treewidth of its underlying undirected graph.


  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. 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)

    Article  MathSciNet  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  5. Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015).

    Book  MATH  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  7. Fomin, F.V., Thilikos, D.M.: New upper bounds on the decomposability of planar graphs. J. Graph Theory 51(1), 53–81 (2006)

    Article  MathSciNet  Google Scholar 

  8. Gyárfás, A.: On the chromatic number of multiple interval graphs and overlap graphs. Discret. Math. 55(2), 161–166 (1985)

    Article  MathSciNet  Google Scholar 

  9. Gyárfás, A.: Corrigendum: on the chromatic number of multiple interval graphs and overlap graphs. Discret. Math. 62(3), 333 (1986)

    Article  Google Scholar 

  10. Gyárfás, A.: Problems from the world surrounding perfect graphs. Applicationes Mathematicae 19(3–4), 413–441 (1987)

    Article  MathSciNet  Google Scholar 

  11. Kim, E.J., Gonçalves, D.: On exact algorithms for the permutation CSP. Theor. Comput. Sci. 511, 109–116 (2013)

    Article  MathSciNet  Google Scholar 

  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)

    Article  MathSciNet  Google Scholar 

  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. Lokshtanov, D., Marx, D., Saurabh, S.: Slightly superexponential parameterized problems. In: SODA vol. 2011, pp. 760–776 (2011)

    Google Scholar 

  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. Lovász, L.: On two minimax theorems in graph. J. Comb. Theory, Ser. B 21(2), 96–103 (1976)

    Article  MathSciNet  Google Scholar 

  17. Lucchesi, C.L., Younger, D.H.: A minimax theorem for directed graphs. J. London Math. Soc 17, 369–374 (1978)

    Article  MathSciNet  Google Scholar 

  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. Schrijver, A.: Combinatorial Optimization - Polyhedra and Efficiency. Springer, Heidelberg (2003)

    MATH  Google Scholar 

  20. Seymour, P.D., Thomas, R.: Call routing and the ratcatcher. Combinatorica 14(2), 217–241 (1994)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations


Corresponding author

Correspondence to Marcin Wrochna .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bonamy, M., Kowalik, Ł., Nederlof, J., Pilipczuk, M., Socała, A., Wrochna, M. (2018). On Directed Feedback Vertex Set Parameterized by Treewidth. In: Brandstädt, A., Köhler, E., Meer, K. (eds) Graph-Theoretic Concepts in Computer Science. WG 2018. Lecture Notes in Computer Science(), vol 11159. Springer, Cham.

Download citation

  • DOI:

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00255-8

  • Online ISBN: 978-3-030-00256-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics