DAG-width is PSPACE-complete

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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science 2016-12, Vol.655, p.78-89
Hauptverfasser:	Amiri, Saeed Akhoondian, Kreutzer, Stephan, Rabinovich, Roman
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms DAG-width Decomposition Graph searching games Graphs Optimization Polynomials PSPACE-complete Trees
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!