Extended MSO Model Checking via Small Vertex Integrity

02/17/2022
โˆ™
by   Tatsuya Gima, et al.
โˆ™
0
โˆ™

We study the model checking problem of an extended ๐–ฌ๐–ฒ๐–ฎ with local and global cardinality constraints, called ๐–ฌ๐–ฒ๐–ฎ^๐–ฆ๐–ซ_๐–ซ๐—‚๐—‡, 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 fill a gap between the fixed-parameter tractability parameterized by vertex cover number and the W[1]-hardness parameterized by treedepth.

READ FULL TEXT

page 1

page 3

page 5

page 13

page 15

page 17

page 19

research
โˆ™ 01/23/2021

Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity

For intractable problems on graphs of bounded treewidth, two graph param...
research
โˆ™ 07/15/2022

Fixed-parameter tractability of Directed Multicut with three terminal pairs parameterized by the size of the cutset: twin-width meets flow-augmentation

We show fixed-parameter tractability of the Directed Multicut problem wi...
research
โˆ™ 09/28/2017

Deobfuscating sparse graphs

We construct a fixed parameter algorithm parameterized by d and k that t...
research
โˆ™ 02/24/2021

On the Parameterized Complexity of Learning Logic

We analyse the complexity of learning first-order definable concepts in ...
research
โˆ™ 06/14/2019

Exact Crossing Number Parameterized by Vertex Cover

We prove that the exact crossing number of a graph can be efficiently co...
research
โˆ™ 09/21/2021

Fine-grained Meta-Theorems for Vertex Integrity

Vertex Integrity is a graph measure which sits squarely between two more...
research
โˆ™ 11/18/2019

Combined Covers and Beth Definability

In ESOP 2008, Gulwani and Musuvathi introduced a notion of cover and exp...

Please sign up or login with your details

Forgot password? Click here to reset