About: Are there any good digraph width measures?

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

About: Are there any good digraph width measures? 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	Several different measures for digraph width have appeared in the last few years. However, none of them shares all the ``nice'' properties of treewidth: First, being algorithmically useful - say, admitting polynomial-time algorithms for all MSO1-definable problems on digraphs of bounded width. And, second, having nice structural properties such as being monotone under taking subdigraphs and some form of arc contractions. Our main result then is that any reasonable algorithmically useful and structurally nice digraph measure cannot be substantially different from the treewidth of the underlying undirected graph Several different measures for digraph width have appeared in the last few years. However, none of them shares all the ``nice'' properties of treewidth: First, being algorithmically useful - say, admitting polynomial-time algorithms for all MSO1-definable problems on digraphs of bounded width. And, second, having nice structural properties such as being monotone under taking subdigraphs and some form of arc contractions. Our main result then is that any reasonable algorithmically useful and structurally nice digraph measure cannot be substantially different from the treewidth of the underlying undirected graph (en)
Title	Are there any good digraph width measures? Are there any good digraph width measures? (en)
skos:prefLabel	Are there any good digraph width measures? Are there any good digraph width measures? (en)
skos:notation	RIV/00216224:14330/10:00065886!RIV14-MSM-14330___
http://linked.open...avai/riv/aktivita	O P S Z
http://linked.open...avai/riv/aktivity	O, 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	247702
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/10:00065886
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	directed graphs; width measures; monadic second order logic; directed graph minors (en)
http://linked.open.../riv/klicoveSlovo	directed graph minors directed graphs width measures monadic second order logic
http://linked.open...ontrolniKodProRIV	[6B8290A549D0]
http://linked.open...v/mistoKonaniAkce	Chennai, India
http://linked.open...i/riv/mistoVydani	India
http://linked.open...i/riv/nazevZdroje	Parameterized and exact computation, IPEC 2010
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	7 (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 Obdržálek, Jan Rossmanith, Peter Sikdar, Somnath Kneis, Joachim Meister, Daniel
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	000286165700014
http://linked.open.../riv/zahajeniAkce	2010-01-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Highly Parallel and Distributed Computing Systems
issn	0302-9743
number of pages	12 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-17493-3_14
http://purl.org/ne...btex#hasPublisher	Lecture Notes in Computer Science, Springer-Verlag
https://schema.org/isbn	9783642174926
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