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

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

Namespace Prefixes

PrefixIRI
n21http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n9http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F08%3A00025022%21RIV11-GA0-14330___/
n7http://purl.org/net/nknouf/ns/bibtex#
n6http://localhost/temp/predkladatel/
n18http://linked.opendata.cz/resource/domain/vavai/projekt/
n16http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n11http://linked.opendata.cz/ontology/domain/vavai/
n19https://schema.org/
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#
n8http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n5http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F08%3A00025022%21RIV11-GA0-14330___
rdf:type
n11:Vysledek skos:Concept
dcterms:description
Rank-width is a rather new structural graph measure introduced by Oum and Seymour in 2003 in order to find an efficiently computable approximation of clique-width of a graph. Being a very nice graph measure indeed, the only serious drawback of rank-width was that it is virtually impossible to use a given rank-decomposition of a graph for running dynamic algorithms on it. We propose a new independent description of rank-decompositions of graphs using labeling parse trees which is, after all, mathematically equivalent to the recent algebraic graph-expression approach to rank-decompositions of Courcelle and Kant\'e [WG'07]. We then use our labeling parse trees to build a Myhill-Nerode-type formalism for handling restricted classes of graphs of bounded rank-width, and to directly prove that (an already indirectly known result) all graph properties expressible in MSO logic are decidable by finite automata running on the labeling parse trees. Rank-width is a rather new structural graph measure introduced by Oum and Seymour in 2003 in order to find an efficiently computable approximation of clique-width of a graph. Being a very nice graph measure indeed, the only serious drawback of rank-width was that it is virtually impossible to use a given rank-decomposition of a graph for running dynamic algorithms on it. We propose a new independent description of rank-decompositions of graphs using labeling parse trees which is, after all, mathematically equivalent to the recent algebraic graph-expression approach to rank-decompositions of Courcelle and Kant\'e [WG'07]. We then use our labeling parse trees to build a Myhill-Nerode-type formalism for handling restricted classes of graphs of bounded rank-width, and to directly prove that (an already indirectly known result) all graph properties expressible in MSO logic are decidable by finite automata running on the labeling parse trees.
dcterms:title
Automata Approach to Graphs of Bounded Rank-width Automata Approach to Graphs of Bounded Rank-width
skos:prefLabel
Automata Approach to Graphs of Bounded Rank-width Automata Approach to Graphs of Bounded Rank-width
skos:notation
RIV/00216224:14330/08:00025022!RIV11-GA0-14330___
n3:aktivita
n17:P
n3:aktivity
P(1M0545), P(GA201/08/0308)
n3:dodaniDat
n5:2011
n3:domaciTvurceVysledku
n16:7595646 n16:6376290
n3:druhVysledku
n4:D
n3:duvernostUdaju
n14:S
n3:entitaPredkladatele
n9:predkladatel
n3:idSjednocenehoVysledku
357363
n3:idVysledku
RIV/00216224:14330/08:00025022
n3:jazykVysledku
n20:eng
n3:klicovaSlova
parameterized algorithm; rank-width; tree automaton; MSO logic
n3:klicoveSlovo
n8:tree%20automaton n8:parameterized%20algorithm n8:rank-width n8:MSO%20logic
n3:kontrolniKodProRIV
[B78C6012AA9C]
n3:mistoKonaniAkce
Nagoya, Japan
n3:mistoVydani
United Kingdom
n3:nazevZdroje
International Workshop on Combinatorial Algorithms IWOCA 2008
n3:obor
n13:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n18:1M0545 n18:GA201%2F08%2F0308
n3:rokUplatneniVysledku
n5:2008
n3:tvurceVysledku
Hliněný, Petr Ganian, Robert
n3:typAkce
n21:WRD
n3:zahajeniAkce
2008-09-13+02:00
s:numberOfPages
12
n7:hasPublisher
Proceedings of the International Workshop on Combinatorial Algorithms 2008, College Publications
n19:isbn
978-1-904987-74-1
n6:organizacniJednotka
14330