This HTML5 document contains 32 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n8http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F10%3A00044285%21RIV11-GA0-14330___/
n9http://localhost/temp/predkladatel/
n10http://linked.opendata.cz/resource/domain/vavai/projekt/
n7http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n12http://linked.opendata.cz/ontology/domain/vavai/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
skoshttp://www.w3.org/2004/02/skos/core#
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n11http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n6http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F10%3A00044285%21RIV11-GA0-14330___
rdf:type
n12:Vysledek skos:Concept
dcterms:description
Many NP-hard graph problems can be efficiently solved on graphs of bounded tree-width. Several articles have recently shown that the so-called rank-width parameter also allows efficient solution of most of these NP-hard problems, while being less restrictive than tree-width. On the other hand however, there exist problems of practical importance which remain hard not only on graphs of bounded rank-width, but even of bounded tree-width or trees. We will introduce linear rank-width, a width parameter which is obtained from rank-width by a restriction analogous to the one used on tree-width to obtain path-width, and show that on the class of graphs of linear rank-width 1 it is possible to solve problems which are hard even on trees. Many NP-hard graph problems can be efficiently solved on graphs of bounded tree-width. Several articles have recently shown that the so-called rank-width parameter also allows efficient solution of most of these NP-hard problems, while being less restrictive than tree-width. On the other hand however, there exist problems of practical importance which remain hard not only on graphs of bounded rank-width, but even of bounded tree-width or trees. We will introduce linear rank-width, a width parameter which is obtained from rank-width by a restriction analogous to the one used on tree-width to obtain path-width, and show that on the class of graphs of linear rank-width 1 it is possible to solve problems which are hard even on trees.
dcterms:title
Algorithmic applications of linear rank-width Algorithmic applications of linear rank-width
skos:prefLabel
Algorithmic applications of linear rank-width Algorithmic applications of linear rank-width
skos:notation
RIV/00216224:14330/10:00044285!RIV11-GA0-14330___
n4:aktivita
n13:S n13:P
n4:aktivity
P(GA201/08/0308), P(GC201/09/J021), S
n4:dodaniDat
n6:2011
n4:domaciTvurceVysledku
n7:6376290
n4:druhVysledku
n16:O
n4:duvernostUdaju
n5:S
n4:entitaPredkladatele
n8:predkladatel
n4:idSjednocenehoVysledku
245925
n4:idVysledku
RIV/00216224:14330/10:00044285
n4:jazykVysledku
n17:eng
n4:klicovaSlova
rank-width; parameterized algorithms
n4:klicoveSlovo
n11:rank-width n11:parameterized%20algorithms
n4:kontrolniKodProRIV
[16813C6B6912]
n4:obor
n15:BD
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
1
n4:projekt
n10:GA201%2F08%2F0308 n10:GC201%2F09%2FJ021
n4:rokUplatneniVysledku
n6:2010
n4:tvurceVysledku
Ganian, Robert
n9:organizacniJednotka
14330