Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2012.112
URN: urn:nbn:de:0030-drops-38553
URL: https://drops.dagstuhl.de/opus/volltexte/2012/3855/
Gajarsky, Jakub ; Hlineny, Petr
Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences
| pdf-format: |
|
Abstract
We prove, in the universe of trees of bounded height, that for any MSO formula with $m$ variables there exists a set of kernels such that the size of each of these kernels can be bounded by an elementary function of m. This yields a faster MSO model checking algorithm for trees of bounded height than the one for general trees.From that we obtain, by means of interpretation, corresponding results for the classes of graphs of bounded tree-depth (MSO_2) and shrub-depth (MSO_1), and thus we give wide generalizations of Lampis' (ESA 2010) and Ganian's (IPEC 2011) results. In the second part of the paper we use this kernel structure to show that FO has the same expressive power as MSO_1 on the graph classes of bounded shrub-depth. This makes bounded shrub-depth a good candidate for characterization of the hereditary classes of graphs on which FO and MSO_1 coincide, a problem recently posed by Elberfeld, Grohe, and Tantau (LICS 2012).
BibTeX - Entry
@InProceedings{gajarsky_et_al:LIPIcs:2012:3855,
author = {Jakub Gajarsky and Petr Hlineny},
title = {{Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012) },
pages = {112--123},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-47-7},
ISSN = {1868-8969},
year = {2012},
volume = {18},
editor = {Deepak D'Souza and Telikepalli Kavitha and Jaikumar Radhakrishnan},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2012/3855},
URN = {urn:nbn:de:0030-drops-38553},
doi = {10.4230/LIPIcs.FSTTCS.2012.112},
annote = {Keywords: MSO graph property, tree-width, tree-depth, shrub-depth}
}
| Keywords: | MSO graph property, tree-width, tree-depth, shrub-depth | |
| Seminar: | IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012) | |
| Issue date: | 2012 | |
| Date of publication: | 14.12.2012 |
