About: Width Parameters Beyond Tree-width and Their Applications

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

About: Width Parameters Beyond Tree-width and Their Applications 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	Besides the very successful concept of tree-width (see [H.~Bodlaender, A.~Koster: {Combinatorial optimisation on graphs of bounded treewidth}]), many concepts and parameters measuring the similarity or dissimilarity of structures compared to trees have been born and studied over the past years. These concepts and parameters have proved to be useful tools in many applications, especially in the design of efficient algorithms. Our presented novel look at the contemporary developments of these ``width'' parameters in combinatorial structures delivers --- besides traditional tree-width and derived dynamic programming schemes --- also a number of other useful parameters like branch-width, rank-width (clique-width), or hypertree-width. In this contribution we demonstrate how ``width'' parameters of graphs and generalized structures (like matroids or hypergraphs), can be used to improve the design of parameterized algorithms and the structural analysis in other applications on an abstract level. Besides the very successful concept of tree-width (see [H.~Bodlaender, A.~Koster: {Combinatorial optimisation on graphs of bounded treewidth}]), many concepts and parameters measuring the similarity or dissimilarity of structures compared to trees have been born and studied over the past years. These concepts and parameters have proved to be useful tools in many applications, especially in the design of efficient algorithms. Our presented novel look at the contemporary developments of these ``width'' parameters in combinatorial structures delivers --- besides traditional tree-width and derived dynamic programming schemes --- also a number of other useful parameters like branch-width, rank-width (clique-width), or hypertree-width. In this contribution we demonstrate how ``width'' parameters of graphs and generalized structures (like matroids or hypergraphs), can be used to improve the design of parameterized algorithms and the structural analysis in other applications on an abstract level. (en)
Title	Width Parameters Beyond Tree-width and Their Applications Width Parameters Beyond Tree-width and Their Applications (en)
skos:prefLabel	Width Parameters Beyond Tree-width and Their Applications Width Parameters Beyond Tree-width and Their Applications (en)
skos:notation	RIV/00216224:14330/07:00020090!RIV10-GA0-14330___
http://linked.open...avai/riv/aktivita	P S Z
http://linked.open...avai/riv/aktivity	P(GA201/05/0050), S, Z(MSM0021622419)
http://linked.open...iv/cisloPeriodika	3
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Hliněný, Petr
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
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	461280
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/07:00020090
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	tree-width; branch-width; rank-width; hypertree-width; parametrized complexity (en)
http://linked.open.../riv/klicoveSlovo	hypertree-width rank-width branch-width tree-width parametrized complexity
http://linked.open...odStatuVydavatele	GB - Spojené království Velké Británie a Severního Irska
http://linked.open...ontrolniKodProRIV	[D1DF2C0F33A8]
http://linked.open...i/riv/nazevZdroje	Computer Journal
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...vavai/riv/projekt	Structural properties and algorithmic complexity of discrete problems
http://linked.open...UplatneniVysledku	2007
http://linked.open...v/svazekPeriodika	51
http://linked.open...iv/tvurceVysledku	Hliněný, Petr Oum, Sang-il Seese, Detlef Gottlob, Georg
http://linked.open...ain/vavai/riv/wos	000255523600005
http://linked.open...n/vavai/riv/zamer	Highly Parallel and Distributed Computing Systems
issn	0010-4620
number of pages	37 (xsd:int)
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, 112 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software