DAG-width is PSPACE-complete

• Published in: Theoretical computer science Vol. 655; pp. 78 - 89
• Main Authors: Amiri, Saeed Akhoondian, Kreutzer, Stephan, Rabinovich, Roman
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 06-12-2016
• Subjects: Algorithms; DAG-width; Decomposition; Graph searching games; Graphs; Optimization; Polynomials; PSPACE-complete; Trees; PSPACE-complete; Graph searching games; DAG-width
• ISSN: 0304-3975; 1879-2294
• DOI: 10.1016/j.tcs.2016.09.011

Berwanger et al. show in [2] that for every graph G of size n and DAG-width k there is a DAG decomposition of width k and size nO(k). They also establish a polynomial time algorithm for deciding whether the DAG-width of a graph is at most a fixed number k. However, if the DAG-width of the graphs is not bounded, such algorithms become exponential. This raises the question whether we can always find a DAG decomposition of size polynomial in n as it is the case for tree width and most other generalisations of tree width similar to DAG-width.
In this paper we show that there is an infinite class of graphs such that every DAG decomposition of optimal width has size super-polynomial in n and, moreover, there is no polynomial size DAG decomposition of width at most k+k1−ε for every ε∈(0,1).
In the second part we use our construction to prove that deciding whether the DAG-width of a given graph is at most a given value is PSpace-complete.