Expanding the Expressive Power of Monadic Second-Order Logic on
Restricted Graph Classes

D 2013

Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes

OBDRŽÁLEK, Jan a Robert GANIAN

Základní údaje

Originální název

Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes

Autoři

OBDRŽÁLEK, Jan (203 Česká republika, garant, domácí) a Robert GANIAN (840 Spojené státy)

Vydání

Berlin Heidelberg, Combinatorial Algorithms 24th International Workshop, IWOCA 2013, od s. 164-177, 14 s. 2013

Nakladatel

Springer

Další údaje

Jazyk

angličtina

Typ výsledku

Stať ve sborníku

Obor

10201 Computer sciences, information science, bioinformatics

Stát vydavatele

Německo

Utajení

není předmětem státního či obchodního tajemství

Forma vydání

tištěná verze "print"

Impakt faktor

Impact factor: 0.402 v roce 2005

Kód RIV

RIV/00216224:14330/13:00066545

Organizační jednotka

Fakulta informatiky

ISBN

978-3-642-45277-2

ISSN

DOI

http://dx.doi.org/10.1007/978-3-642-45278-9_15

Klíčová slova anglicky

MSO; model checking; vertex cover; meta-theorems; parameterized complexity

Štítky

core_B, firank_B, formela-conference

Příznaky

Recenzováno

Změněno: 30. 9. 2014 11:28, doc. Mgr. Jan Obdržálek, PhD.

Anotace

V originále

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 elementary dependence on the parameter and formula. We also show that both results are easily extended from vertex cover to neighborhood diversity.

Návaznosti

GAP202/11/0196, projekt VaV

Název: Třídy dobře strukturovaných kombinatorických objektů, šířkové parametry a návrh efektivních algoritmů

Investor: Grantová agentura ČR, Třídy dobře strukturovaných kombinatorických objektů, šířkové parametry a návrh efektivních algoritmů

Citovat

OBDRŽÁLEK, Jan a Robert GANIAN. Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes. In Thierry Lecroq, Laurent Mouchard. Combinatorial Algorithms 24th International Workshop, IWOCA 2013. Berlin Heidelberg: Springer, 2013, s. 164-177. ISBN 978-3-642-45277-2. Dostupné z: https://dx.doi.org/10.1007/978-3-642-45278-9_15.

@inproceedings{1130962,
   author = {Obdržálek, Jan and Ganian, Robert},
   address = {Berlin Heidelberg},
   booktitle = {Combinatorial Algorithms 24th International Workshop, IWOCA 2013},
   doi = {http://dx.doi.org/10.1007/978-3-642-45278-9_15},
   editor = {Thierry Lecroq, Laurent Mouchard},
   keywords = {MSO; model checking; vertex cover; meta-theorems; parameterized complexity},
   howpublished = {tištěná verze "print"},
   language = {eng},
   location = {Berlin Heidelberg},
   isbn = {978-3-642-45277-2},
   pages = {164-177},
   publisher = {Springer},
   title = {Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes},
   year = {2013}
}

TY  - JOUR
ID  - 1130962
AU  - Obdržálek, Jan - Ganian, Robert
PY  - 2013
TI  - Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes
PB  - Springer
CY  - Berlin Heidelberg
SN  - 9783642452772
KW  - MSO
KW  - model checking
KW  - vertex cover
KW  - meta-theorems
KW  - parameterized complexity
N2  - 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 elementary dependence on the parameter and formula. We also show that both results are easily extended from vertex cover to neighborhood diversity.
ER  -

OBDRŽÁLEK, Jan a Robert GANIAN. Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes. In Thierry Lecroq, Laurent Mouchard. \textit{Combinatorial Algorithms 24th International Workshop, IWOCA 2013}. Berlin Heidelberg: Springer, 2013, s.~164-177. ISBN~978-3-642-45277-2. Dostupné z: https://dx.doi.org/10.1007/978-3-642-45278-9\_{}15.

Podrobný výpis o publikaci