New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes

  • Robert Ganian
  • Petr Hliněný
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5901)

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”.

Keywords

Directed graph complexity oriented colouring DAG-depth 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    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)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    Eggan, L.: Transition Graphs and the Star-Height of Regular Events. Michigan Mathematical Journal 10(4), 385–397 (1963)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Hunter, P., Kreutzer, S.: Digraph Measures: Kelly Decompositions, Games, and Orderings. Theor. Comput. Sci. 399(3), 206–219 (2008)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Johnson, T., Robertson, N., Seymour, P.D., Thomas, R.: Directed Treewidth. J. Combin. Theory Ser. B 82(1), 138–154 (2001)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Kanté, M.: The Rank-Width of Directed Graphs. arXiv:0709.1433v3 (2008)Google Scholar
  10. 10.
    Nešetřil, J., Ossona de Mendez, P.: Tree-Depth, Subgraph Coloring and Homomorphism Bounds. European J. Combin. 27(6), 1024–1041 (2006)Google Scholar
  11. 11.
    Nešetřil, J., Raspaud, A.: Colored Homomorphisms of Colored Mixed Graphs. J. Combin. Theory Ser. B 80(1), 147–155 (2000)MATHMathSciNetGoogle Scholar
  12. 12.
    Obdržálek, J.: DAG-Width: Connectivity Measure for Directed Graphs. In: SODA 2006, pp. 814–821. ACM-SIAM (2006)Google Scholar
  13. 13.
    Robertson, N., Seymour, P.: Graph Minors X. Obstructions to Tree-Decomposition. J. Combin. Theory Ser. B 52(2), 153–190 (1991)MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Sopena, É.: Oriented Graph Coloring. Discrete Math. 229, 359–369 (2001)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Robert Ganian
    • 1
  • Petr Hliněný
    • 1
  1. 1.Faculty of InformaticsMasaryk UniversityBrnoCzech Republic

Personalised recommendations