About: On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width

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

About: On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width 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	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. (en)
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 (en)
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 (en)
skos:notation	RIV/00216224:14330/10:00043472!RIV11-GA0-14330___
http://linked.open...avai/riv/aktivita	P S Z
http://linked.open...avai/riv/aktivity	P(GA201/08/0308), P(GC201/09/J021), S, Z(MSM0021622419)
http://linked.open...iv/cisloPeriodika	1
http://linked.open...vai/riv/dodaniDat	2011
http://linked.open...aciTvurceVysledku	Ganian, Robert 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	276764
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/10:00043472
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	rank-width; parameterized algorithms; graphs (en)
http://linked.open.../riv/klicoveSlovo	graphs rank-width parameterized algorithms
http://linked.open...odStatuVydavatele	NL - Nizozemsko
http://linked.open...ontrolniKodProRIV	[A4812E1452FC]
http://linked.open...i/riv/nazevZdroje	Discrete Applied Mathematics
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (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...v/svazekPeriodika	158
http://linked.open...iv/tvurceVysledku	Ganian, Robert Hliněný, Petr
http://linked.open...ain/vavai/riv/wos	000276731700014
http://linked.open...n/vavai/riv/zamer	Highly Parallel and Distributed Computing Systems
issn	0166-218X
number of pages	17 (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, 24 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software