Další formáty:
BibTeX
LaTeX
RIS
@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 a Peter ROSSMANITH. Digraph width measures in parameterized algorithmics. \textit{Discrete Applied Mathematics}. Elsevier B.V., roč.~168, č.~1, s.~88-107. ISSN~0166-218X. doi:10.1016/j.dam.2013.10.038. 2014.
|
