When Trees Grow Low: Shrubs and Fast MSO1

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F12%3A00057596" target="_blank" >RIV/00216224:14330/12:00057596 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-32589-2_38" target="_blank" >http://dx.doi.org/10.1007/978-3-642-32589-2_38</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-32589-2_38" target="_blank" >10.1007/978-3-642-32589-2_38</a>

Result language
angličtina
Original language name
When Trees Grow Low: Shrubs and Fast MSO1
Original language 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 ofa 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 extensionof 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.
Czech name
—
Czech description
—

Project
<a href="/en/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Center of excellence - Institute for theoretical computer science (CE-ITI)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)