License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ISAAC.2022.20
URN: urn:nbn:de:0030-drops-173056
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/17305/
Gima, Tatsuya ;
Otachi, Yota
Extended MSO Model Checking via Small Vertex Integrity
Abstract
We study the model checking problem of an extended MSO with local and global cardinality constraints, called MSO^GL_Lin, introduced recently by Knop, Koutecký, Masařík, and Toufar [Log. Methods Comput. Sci., 15(4), 2019]. We show that the problem is fixed-parameter tractable parameterized by vertex integrity, where vertex integrity is a graph parameter standing between vertex cover number and treedepth. Our result thus narrows the gap between the fixed-parameter tractability parameterized by vertex cover number and the W[1]-hardness parameterized by treedepth.
BibTeX - Entry
@InProceedings{gima_et_al:LIPIcs.ISAAC.2022.20,
author = {Gima, Tatsuya and Otachi, Yota},
title = {{Extended MSO Model Checking via Small Vertex Integrity}},
booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)},
pages = {20:1--20:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-258-7},
ISSN = {1868-8969},
year = {2022},
volume = {248},
editor = {Bae, Sang Won and Park, Heejin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/17305},
URN = {urn:nbn:de:0030-drops-173056},
doi = {10.4230/LIPIcs.ISAAC.2022.20},
annote = {Keywords: vertex integrity, monadic second-order logic, cardinality constraint, fixed-parameter tractability}
}
|
Keywords: |
|
vertex integrity, monadic second-order logic, cardinality constraint, fixed-parameter tractability |
|
Collection: |
|
33rd International Symposium on Algorithms and Computation (ISAAC 2022) |
|
Issue Date: |
|
2022 |
|
Date of publication: |
|
14.12.2022 |
