New results on the complexity of oriented colouring on restricted digraph classes
| Authors | |
|---|---|
| Year of publication | 2010 |
| Type | Article in Proceedings |
| Conference | SOFSEM 2010, Lecture Notes in Computer Science 5901 |
| MU Faculty or unit | |
| Citation | |
| Web | DOI |
| Doi | http://dx.doi.org/10.1007/978-3-642-11266-9_36 |
| Field | Informatics |
| Keywords | Directed graph; complexity; oriented colouring; DAG-depth |
| Description | 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. |
| Related projects: |