The Parameterized Complexity of Oriented Colouring

Logo poskytovatele

Varování

Publikace nespadá pod Filozofickou fakultu, ale pod Fakultu informatiky. Oficiální stránka publikace je na webu muni.cz.
Autoři

GANIAN Robert

Rok publikování 2009
Druh Článek ve sborníku
Konference MEMICS 2009 proceedings
Fakulta / Pracoviště MU

Fakulta informatiky

Citace
www http://drops.dagstuhl.de/opus/frontdoor.php?source_opus=2342
Obor Teorie informace
Klíčová slova Oriented colouring; Parameterized complexity; digraphs; directed graphs; width measures
Popis The oriented colouring problem is intuitive and related to undirected colouring, yet remains NP-hard even on digraph classes with bounded traditional directed width measures. Recently we have also proved that it remains NP-hard in otherwise severely restricted digraph classes. However, unlike most other problems on directed graphs, the oriented colouring problem is not directly transferable to undirected graphs. In the article we look at the parameterized complexity of computing the oriented colouring of digraphs with bounded undirected width parameters, whereas the parameters "forget" about the orientations of arcs and parse them as edges. Specifically, we provide new complexity results for computing oriented colouring on digraphs of bounded undirected rank-width and a new algorithm for this problem on digraphs of bounded undirected tree-width.
Související projekty:

Používáte starou verzi internetového prohlížeče. Doporučujeme aktualizovat Váš prohlížeč na nejnovější verzi.