About: New results on the complexity of oriented colouring on restricted digraph classes

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: New results on the complexity of oriented colouring on restricted digraph classes Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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. 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. (en)
Title	New results on the complexity of oriented colouring on restricted digraph classes New results on the complexity of oriented colouring on restricted digraph classes (en)
skos:prefLabel	New results on the complexity of oriented colouring on restricted digraph classes New results on the complexity of oriented colouring on restricted digraph classes (en)
skos:notation	RIV/00216224:14330/10:00065874!RIV14-MSM-14330___
http://linked.open...avai/riv/aktivita	P S
http://linked.open...avai/riv/aktivity	P(GA201/08/0308), P(GC201/09/J021), S
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Ganian, Robert Hliněný, Petr
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Masarykova univerzita / Fakulta informatiky
http://linked.open...dnocenehoVysledku	274759
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/10:00065874
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Directed graph; complexity; oriented colouring; DAG-depth (en)
http://linked.open.../riv/klicoveSlovo	complexity DAG-depth Directed graph oriented colouring
http://linked.open...ontrolniKodProRIV	[7B63064EB386]
http://linked.open...v/mistoKonaniAkce	Špindlerův mlýn
http://linked.open...i/riv/mistoVydani	Berlin
http://linked.open...i/riv/nazevZdroje	SOFSEM 2010, Lecture Notes in Computer Science 5901
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Structural graph theory and parameterized complexity Utilization of structural and %22Width%22 parameters in combinatorics and algorithmic complexity
http://linked.open...UplatneniVysledku	2010
http://linked.open...iv/tvurceVysledku	Ganian, Robert Hliněný, Petr
http://linked.open...vavai/riv/typAkce	EUR - Evropská
http://linked.open...ain/vavai/riv/wos	000280086900036
http://linked.open.../riv/zahajeniAkce	2010-01-01 (xsd:date)
issn	0302-9743
number of pages	12 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-11266-9_36
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	9783642112652
http://localhost/t...ganizacniJednotka	14330

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 24 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software