Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{950101,
author = {Ganian, Robert and Hliněný, Petr and Obdržálek, Jan},
address = {Dagstuhl, Germany},
booktitle = {28th International Symposium on Theoretical Aspects of Computer Science STACS2011},
doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2011.404},
edition = {2011},
editor = {Thomas Schwentick and Christoph D{\"u}rr},
keywords = {clique-width; parameterized algorithm; XP},
howpublished = {elektronická verze "online"},
language = {eng},
location = {Dagstuhl, Germany},
isbn = {978-3-939897-25-5},
pages = {404-415},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS},
title = {Clique-width: When Hard Does Not Mean Impossible},
url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2011.404},
year = {2011}
}
TY - JOUR
ID - 950101
AU - Ganian, Robert - Hliněný, Petr - Obdržálek, Jan
PY - 2011
TI - Clique-width: When Hard Does Not Mean Impossible
PB - Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS
CY - Dagstuhl, Germany
SN - 9783939897255
KW - clique-width
KW - parameterized algorithm
KW - XP
UR - http://dx.doi.org/10.4230/LIPIcs.STACS.2011.404
L2 - http://dx.doi.org/10.4230/LIPIcs.STACS.2011.404
N2 - In recent years, the parameterized complexity approach has lead to the introduction of many new algorithms and frameworks on graphs and digraphs of bounded clique-width and, equivalently, rank-width. However, despite intensive work on the subject, there still exist well-established hard problems where neither a parameterized algorithm nor a theoretical obstacle to its existence are known. Our article is interested mainly in the digraph case, targeting the well-known Minimum Leaf Out-Branching (cf.\ also Minimum Leaf Spanning Tree) and Edge Disjoint Paths problems on digraphs of bounded clique-width with non-standard new approaches.
ER -
GANIAN, Robert, Petr HLINĚNÝ a Jan OBDRŽÁLEK. Clique-width: When Hard Does Not Mean Impossible. Online. In Thomas Schwentick and Christoph D$\{\backslash$''u$\}$rr. \textit{28th International Symposium on Theoretical Aspects of Computer Science STACS2011}. 2011. vyd. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, LIPICS, 2011, s.~404-415. ISBN~978-3-939897-25-5. Dostupné z: https://dx.doi.org/10.4230/LIPIcs.STACS.2011.404.
|
