Abstract
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, IWPEC’09]) 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”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berwanger, D., Dawar, A., Hunter, P., Kreutzer, S.: DAG-Width and Parity Games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 524–536. Springer, Heidelberg (2006)
Courcelle, B.: The Monadic Second Order-Logic of Graphs VI: on Several Representations of Graphs by Relational Structures. Discrete Appl. Math. 54, 117–149 (1994)
Culus, J.-F., Demange, M.: Oriented Coloring: Complexity and Approximation. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 226–236. Springer, Heidelberg (2006)
Eggan, L.: Transition Graphs and the Star-Height of Regular Events. Michigan Mathematical Journal 10(4), 385–397 (1963)
Ganian, R., Hliněný, P.: Better Polynomial Algorithms on Graphs of Bounded Rank-Width. In: IWOCA 2009, Extended Abstract. LNCS. Springer, Heidelberg (to appear, 2009)
Ganian, R., Hliněný, P., Kneis, J., Langer, A., Obdržálek, J., Rossmanith, P.: On Digraph Width Measures in Parameterized Algorithmics. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 185–197. Springer, Heidelberg (2009)
Hunter, P., Kreutzer, S.: Digraph Measures: Kelly Decompositions, Games, and Orderings. Theor. Comput. Sci. 399(3), 206–219 (2008)
Johnson, T., Robertson, N., Seymour, P.D., Thomas, R.: Directed Treewidth. J. Combin. Theory Ser. B 82(1), 138–154 (2001)
Kanté, M.: The Rank-Width of Directed Graphs. arXiv:0709.1433v3 (2008)
Nešetřil, J., Ossona de Mendez, P.: Tree-Depth, Subgraph Coloring and Homomorphism Bounds. European J. Combin. 27(6), 1024–1041 (2006)
Nešetřil, J., Raspaud, A.: Colored Homomorphisms of Colored Mixed Graphs. J. Combin. Theory Ser. B 80(1), 147–155 (2000)
Obdržálek, J.: DAG-Width: Connectivity Measure for Directed Graphs. In: SODA 2006, pp. 814–821. ACM-SIAM (2006)
Robertson, N., Seymour, P.: Graph Minors X. Obstructions to Tree-Decomposition. J. Combin. Theory Ser. B 52(2), 153–190 (1991)
Sopena, É.: Oriented Graph Coloring. Discrete Math. 229, 359–369 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ganian, R., Hliněný, P. (2010). New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J., Rumpe, B. (eds) SOFSEM 2010: Theory and Practice of Computer Science. SOFSEM 2010. Lecture Notes in Computer Science, vol 5901. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11266-9_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-11266-9_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11265-2
Online ISBN: 978-3-642-11266-9
eBook Packages: Computer ScienceComputer Science (R0)