About: When Trees Grow Low: Shrubs and Fast MSO1

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

About: When Trees Grow Low: Shrubs and Fast MSO1 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	Recent characterization [9] of those graphs for which coloured MSO2 model checking is fast raised the interest in the graph invariant called tree-depth. Looking for a similar characterization for (coloured) MSO1, we introduce the notion of shrub-depth of a graph class. To prove that MSO1 model checking is fast for classes of bounded shrub-depth, we show that shrub-depth exactly characterizes the graph classes having interpretation in coloured trees of bounded height. We also introduce a common extension of cographs and of graphs with bounded shrub-depth - m-partite cographs (still of bounded clique-width), which are well quasi-ordered by the relation “is an induced subgraph of” and therefore allow polynomial time testing of hereditary properties. Recent characterization [9] of those graphs for which coloured MSO2 model checking is fast raised the interest in the graph invariant called tree-depth. Looking for a similar characterization for (coloured) MSO1, we introduce the notion of shrub-depth of a graph class. To prove that MSO1 model checking is fast for classes of bounded shrub-depth, we show that shrub-depth exactly characterizes the graph classes having interpretation in coloured trees of bounded height. We also introduce a common extension of cographs and of graphs with bounded shrub-depth - m-partite cographs (still of bounded clique-width), which are well quasi-ordered by the relation “is an induced subgraph of” and therefore allow polynomial time testing of hereditary properties. (en)
Title	When Trees Grow Low: Shrubs and Fast MSO1 When Trees Grow Low: Shrubs and Fast MSO1 (en)
skos:prefLabel	When Trees Grow Low: Shrubs and Fast MSO1 When Trees Grow Low: Shrubs and Fast MSO1 (en)
skos:notation	RIV/00216224:14330/12:00057596!RIV13-GA0-14330___
http://linked.open...avai/predkladatel	Fakulta informatiky
http://linked.open...avai/riv/aktivita	P S
http://linked.open...avai/riv/aktivity	P(GBP202/12/G061), S
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Obdržálek, Jan Ganian, Robert Hliněný, Petr Ramadurai, Reshma
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
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	180910
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/12:00057596
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	tree-depth; shrub-depth; MSO model checking (en)
http://linked.open.../riv/klicoveSlovo	shrub-depth tree-depth MSO model checking
http://linked.open...ontrolniKodProRIV	[1333FBFB6F54]
http://linked.open...v/mistoKonaniAkce	Bratislava
http://linked.open...i/riv/mistoVydani	Německo
http://linked.open...i/riv/nazevZdroje	Math Foundations of Computer Science MFCS 2012
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	4 (xsd:int)
http://linked.open...cetTvurcuVysledku	6 (xsd:int)
http://linked.open...vavai/riv/projekt	Center of excellence - Institute for theoretical computer science (CE-ITI)
http://linked.open...UplatneniVysledku	2012
http://linked.open...iv/tvurceVysledku	Ganian, Robert Hliněný, Petr Nešetřil, Jaroslav Obdržálek, Jan Ossona de Mendez, Patrice Ramadurai, Reshma
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2012-01-01 (xsd:date)
issn	0302-9743
number of pages	12 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-32589-2_38
http://purl.org/ne...btex#hasPublisher	Lecture Notes in Computer Science, Springer-Verlag
https://schema.org/isbn	9783642325885
http://localhost/t...ganizacniJednotka	14330
is http://linked.open...avai/riv/vysledek of	When Trees Grow Low: Shrubs and Fast MSO1

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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software