| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4952413 | Theoretical Computer Science | 2016 | 12 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Saeed Akhoondian Amiri, Stephan Kreutzer, Roman Rabinovich,