This HTML5 document contains 44 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/
n9http://localhost/temp/predkladatel/
n14http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n4http://linked.opendata.cz/resource/domain/vavai/projekt/
n13http://linked.opendata.cz/ontology/domain/vavai/
n12http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
n16http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F10%3A00043472%21RIV11-GA0-14330___/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n19http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F10%3A00043472%21RIV11-GA0-14330___
rdf:type
n13:Vysledek skos:Concept
dcterms:description
Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework and tools for easy design of dynamic algorithms running directly on a rankdecomposition of a graph (on contrary to the usual approach which translates a rank decomposition into a clique-width expression, with a possible exponential jump in the parameter). The main advantage of this framework is a fine control over the runtime dependency on the rank-width parameter. Our new approach is linked to a work of Courcelle and Kanté [7] who first proposed algebraic expressions with a so-called bilinear graph product as a better way of handling rank-decompositions, and to a parallel recent research of Bui-Xuan, Telle and Vatshelle. Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework and tools for easy design of dynamic algorithms running directly on a rankdecomposition of a graph (on contrary to the usual approach which translates a rank decomposition into a clique-width expression, with a possible exponential jump in the parameter). The main advantage of this framework is a fine control over the runtime dependency on the rank-width parameter. Our new approach is linked to a work of Courcelle and Kanté [7] who first proposed algebraic expressions with a so-called bilinear graph product as a better way of handling rank-decompositions, and to a parallel recent research of Bui-Xuan, Telle and Vatshelle.
dcterms:title
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
skos:prefLabel
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
skos:notation
RIV/00216224:14330/10:00043472!RIV11-GA0-14330___
n3:aktivita
n11:Z n11:S n11:P
n3:aktivity
P(GA201/08/0308), P(GC201/09/J021), S, Z(MSM0021622419)
n3:cisloPeriodika
1
n3:dodaniDat
n19:2011
n3:domaciTvurceVysledku
n14:7595646 n14:6376290
n3:druhVysledku
n18:J
n3:duvernostUdaju
n10:S
n3:entitaPredkladatele
n16:predkladatel
n3:idSjednocenehoVysledku
276764
n3:idVysledku
RIV/00216224:14330/10:00043472
n3:jazykVysledku
n17:eng
n3:klicovaSlova
rank-width; parameterized algorithms; graphs
n3:klicoveSlovo
n15:parameterized%20algorithms n15:rank-width n15:graphs
n3:kodStatuVydavatele
NL - Nizozemsko
n3:kontrolniKodProRIV
[A4812E1452FC]
n3:nazevZdroje
Discrete Applied Mathematics
n3:obor
n6:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n4:GA201%2F08%2F0308 n4:GC201%2F09%2FJ021
n3:rokUplatneniVysledku
n19:2010
n3:svazekPeriodika
158
n3:tvurceVysledku
Hliněný, Petr Ganian, Robert
n3:wos
000276731700014
n3:zamer
n12:MSM0021622419
s:issn
0166-218X
s:numberOfPages
17
n9:organizacniJednotka
14330