Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F13%3A00066545" target="_blank" >RIV/00216224:14330/13:00066545 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-45278-9_15" target="_blank" >http://dx.doi.org/10.1007/978-3-642-45278-9_15</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-45278-9_15" target="_blank" >10.1007/978-3-642-45278-9_15</a>
Alternative languages
Result language
angličtina
Original language name
Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes
Original language description
We combine integer linear programming and recent advances in Monadic Second-Order model checking to obtain two new algorithmic meta-theorems for graphs of bounded vertex-cover. The first one shows that the model checking problem for cardMSO1, an extension of the well-known Monadic Second-Order logic by the addition of cardinality constraints, can be solved in FPT time parameterized by vertex cover. The second meta-theorem shows that the MSO partitioning problems introduced by Rao can also be solved in FPT time with the same parameter. The significance of our contribution stems from the fact that these formalisms can describe problems which are W[1]-hard and even NP-hard on graphs of bounded tree-width. Additionally, our algorithms have only elementarydependence on the parameter and formula. We also show that both results are easily extended from vertex cover to neighborhood diversity.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GAP202%2F11%2F0196" target="_blank" >GAP202/11/0196: Well-structured combinatorial classes, width parameters, and design of efficient algorithms</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Combinatorial Algorithms 24th International Workshop, IWOCA 2013
ISBN
9783642452772
ISSN
0302-9743
e-ISSN
—
Number of pages
14
Pages from-to
164-177
Publisher name
Springer
Place of publication
Berlin Heidelberg
Event location
Rouen, France
Event date
Jan 1, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—