Digraph width measures in parameterized algorithmics

In contrast to undirected width measures such as tree-width, which have provided many important algorithmic applications, analogous measures for digraphs such as directed tree-width or DAG-width do not seem so successful. Several recent papers have given some evidence on the negative side. We confir...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics 2014-05, Vol.168, p.88-107
Main Authors: Ganian, Robert, Hliněný, Petr, Kneis, Joachim, Langer, Alexander, Obdržálek, Jan, Rossmanith, Peter
Format: Article
Language:English
Subjects:
Algorithms
Clique-width
Complexity
Consolidation
DAG-depth
DAG-width
Digraph
Graph theory
Graphs
Mathematical analysis
Parameterized complexity
Pictures
Tree-width
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In contrast to undirected width measures such as tree-width, which have provided many important algorithmic applications, analogous measures for digraphs such as directed tree-width or DAG-width do not seem so successful. Several recent papers have given some evidence on the negative side. We confirm and consolidate this overall picture by thoroughly and exhaustively studying the complexity of a range of directed problems with respect to various parameters, and by showing that they often remain NP-hard even on graph classes that are restricted very beyond having small DAG-width. On the positive side, it turns out that clique-width (of digraphs) performs much better on virtually all considered problems, from the parameterized complexity point of view.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2013.10.038