About: On Digraph Width Measures in Parameterized Algorithmics

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

About: On Digraph Width Measures in Parameterized Algorithmics 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	In contrast to undirected width measures (such as treewidth or clique-width), which have provided many important algorithmic applications, analogous measures for digraphs such as DAGwidth or Kelly-width do not seem so successful. Several recent papers, e.g. those of Kreutzer-Ordyniak, Dankelmann-Gutin-Kim, or Lampis-Kaouri-Mitsou, have given some evidence for this. We support this direction by showing that many quite different problems remain hard even on graph classes that are restricted very beyond simply having small DAG-width. To this end, we introduce new measures K-width and DAGdepth. On the positive side, we also note that taking Kanté's directed generalization of rank-width as a parameter makes many problems fixed parameter tractable. In contrast to undirected width measures (such as treewidth or clique-width), which have provided many important algorithmic applications, analogous measures for digraphs such as DAGwidth or Kelly-width do not seem so successful. Several recent papers, e.g. those of Kreutzer-Ordyniak, Dankelmann-Gutin-Kim, or Lampis-Kaouri-Mitsou, have given some evidence for this. We support this direction by showing that many quite different problems remain hard even on graph classes that are restricted very beyond simply having small DAG-width. To this end, we introduce new measures K-width and DAGdepth. On the positive side, we also note that taking Kanté's directed generalization of rank-width as a parameter makes many problems fixed parameter tractable. (en)
Title	On Digraph Width Measures in Parameterized Algorithmics On Digraph Width Measures in Parameterized Algorithmics (en)
skos:prefLabel	On Digraph Width Measures in Parameterized Algorithmics On Digraph Width Measures in Parameterized Algorithmics (en)
skos:notation	RIV/00216224:14330/09:00065869!RIV14-MSM-14330___
http://linked.open...avai/riv/aktivita	P S Z
http://linked.open...avai/riv/aktivity	P(GA201/08/0308), P(GC201/09/J021), S, Z(MSM0021622419)
http://linked.open...vai/riv/dodaniDat	2014
http://linked.open...aciTvurceVysledku	Obdržálek, Jan 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	331370
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/09:00065869
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	digraph; DAG-width; bi-rank-width; parameterized complexity (en)
http://linked.open.../riv/klicoveSlovo	DAG-width bi-rank-width parameterized complexity digraph
http://linked.open...ontrolniKodProRIV	[7655C69053A3]
http://linked.open...v/mistoKonaniAkce	Copenhagen, Denmark
http://linked.open...i/riv/mistoVydani	Berlin
http://linked.open...i/riv/nazevZdroje	IWPEC 2009: International Workshop on Parameterized and Exact Computation, Lecture Notes in Computer Science
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	6 (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	2009
http://linked.open...iv/tvurceVysledku	Ganian, Robert Hliněný, Petr Obdržálek, Jan Rossmanith, Peter Langer, Alexander Kneis, Joachim
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	000278758300015
http://linked.open.../riv/zahajeniAkce	2009-09-10 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Highly Parallel and Distributed Computing Systems
issn	0302-9743
number of pages	13 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-11269-0_15
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	9783642112683
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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software