Digraph width measures in parameterized algorithmics

J 2014

Digraph width measures in parameterized algorithmics

GANIAN, Robert, Petr HLINĚNÝ, Joachim KNEIS, Alexander LANGER, Jan OBDRŽÁLEK et. al.

Basic information

Original name

Digraph width measures in parameterized algorithmics

Authors

GANIAN, Robert (840 United States of America, belonging to the institution), Petr HLINĚNÝ (203 Czech Republic, belonging to the institution), Joachim KNEIS (276 Germany), Alexander LANGER (276 Germany), Jan OBDRŽÁLEK (203 Czech Republic, guarantor, belonging to the institution) and Peter ROSSMANITH (276 Germany)

Edition

Discrete Applied Mathematics, Elsevier B.V. 2014, 0166-218X

Other information

Language

English

Type of outcome

Článek v odborném periodiku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Netherlands

Confidentiality degree

není předmětem státního či obchodního tajemství

Impact factor

Impact factor: 0.802

RIV identification code

RIV/00216224:14330/14:00073690

Organization unit

Faculty of Informatics

DOI

http://dx.doi.org/10.1016/j.dam.2013.10.038

UT WoS

000334485900011

Keywords in English

Digraph;Parameterized complexity;Tree-width;DAG-width;DAG-depth;Clique-width

Abstract

V originále

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.

Links

GBP202/12/G061, research and development project

Name: Centrum excelence - Institut teoretické informatiky (CE-ITI) (Acronym: CE-ITI)

Investor: Czech Science Foundation

GC201/09/J021, research and development project

Name: Strukturální teorie grafů a parametrizovaná složitost

Investor: Czech Science Foundation, Structural graph theory and parameterized complexity

Citovat

GANIAN, Robert, Petr HLINĚNÝ, Joachim KNEIS, Alexander LANGER, Jan OBDRŽÁLEK and Peter ROSSMANITH. Digraph width measures in parameterized algorithmics. Discrete Applied Mathematics. Elsevier B.V., 2014, vol. 168, No 1, p. 88-107. ISSN 0166-218X. Available from: https://dx.doi.org/10.1016/j.dam.2013.10.038.

@article{1186160,
   author = {Ganian, Robert and Hliněný, Petr and Kneis, Joachim and Langer, Alexander and Obdržálek, Jan and Rossmanith, Peter},
   article_number = {1},
   doi = {http://dx.doi.org/10.1016/j.dam.2013.10.038},
   keywords = {Digraph;Parameterized complexity;Tree-width;DAG-width;DAG-depth;Clique-width},
   language = {eng},
   issn = {0166-218X},
   journal = {Discrete Applied Mathematics},
   title = {Digraph width measures in parameterized algorithmics},
   volume = {168},
   year = {2014}
}

TY  - JOUR
ID  - 1186160
AU  - Ganian, Robert - Hliněný, Petr - Kneis, Joachim - Langer, Alexander - Obdržálek, Jan - Rossmanith, Peter
PY  - 2014
TI  - Digraph width measures in parameterized algorithmics
JF  - Discrete Applied Mathematics
VL  - 168
IS  - 1
SP  - 88-107
EP  - 88-107
PB  - Elsevier B.V.
SN  - 0166218X
KW  - Digraph;Parameterized complexity;Tree-width;DAG-width;DAG-depth;Clique-width
N2  - 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.
ER  -

GANIAN, Robert, Petr HLINĚNÝ, Joachim KNEIS, Alexander LANGER, Jan OBDRŽÁLEK and Peter ROSSMANITH. Digraph width measures in parameterized algorithmics. \textit{Discrete Applied Mathematics}. Elsevier B.V., 2014, vol.~168, No~1, p.~88-107. ISSN~0166-218X. Available from: https://dx.doi.org/10.1016/j.dam.2013.10.038.

Detailed Information on Publication Record