Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{889916, author = {Ganian, Robert and Hliněný, Petr}, address = {Berlin}, booktitle = {SOFSEM 2010, Lecture Notes in Computer Science 5901}, doi = {http://dx.doi.org/10.1007/978-3-642-11266-9_36}, edition = {5901}, keywords = {Directed graph; complexity; oriented colouring; DAG-depth}, howpublished = {tištěná verze "print"}, language = {eng}, location = {Berlin}, isbn = {978-3-642-11265-2}, pages = {428-439}, publisher = {Springer}, title = {New results on the complexity of oriented colouring on restricted digraph classes}, url = {http://dx.doi.org/10.1007/978-3-642-11266-9_36}, year = {2010} }
TY - JOUR ID - 889916 AU - Ganian, Robert - Hliněný, Petr PY - 2010 TI - New results on the complexity of oriented colouring on restricted digraph classes PB - Springer CY - Berlin SN - 9783642112652 KW - Directed graph KW - complexity KW - oriented colouring KW - DAG-depth UR - http://dx.doi.org/10.1007/978-3-642-11266-9_36 N2 - Oriented colouring is a quite intuitive generalization of undirected colouring, yet the problem remains NP-hard even on digraph classes with bounded usual directed width measures. In light of this fact, one might ask whether new width measures are required for efficient dealing with this problem or whether further restriction of traditional directed width measures such as DAG-width would suffice. The K-width and DAG-depth measures (introduced by [Ganian et al, IWPEC09]) are ideal candidates for tackling this question: They are both closely tied to the cops-and-robber games which inspire and characterize the most renowned directed width measures, while at the same time being much more restrictive. In this paper, we look at the oriented colouring problem on digraphs of bounded K-width and of bounded DAG-depth. We provide new polynomial algorithms for solving the problem on small instances as well as new strong hardness results showing that the input restrictions required by our algorithms are in fact tight. ER -
GANIAN, Robert a Petr HLINĚNÝ. New results on the complexity of oriented colouring on restricted digraph classes. In \textit{SOFSEM 2010, Lecture Notes in Computer Science 5901}. 5901. vyd. Berlin: Springer, 2010, s.~428-439. ISBN~978-3-642-11265-2. Dostupné z: https://dx.doi.org/10.1007/978-3-642-11266-9\_{}36.
|