Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited

07/03/2022
by   Tatsuya Gima, et al.
0

Given a graph and two vertex sets satisfying a certain feasibility condition, a reconfiguration problem asks whether we can reach one vertex set from the other by repeating prescribed modification steps while maintaining feasibility. In this setting, Mouawad et al. [IPEC 2014] presented an algorithmic meta-theorem for reconfiguration problems that says if the feasibility can be expressed in monadic second-order logic (MSO), then the problem is fixed-parameter tractable parameterized by treewidth + ℓ, where ℓ is the number of steps allowed to reach the target set. On the other hand, it is shown by Wrochna [J. Comput. Syst. Sci. 2018] that if ℓ is not part of the parameter, then the problem is PSPACE-complete even on graphs of bounded bandwidth. In this paper, we present the first algorithmic meta-theorems for the case where ℓ is not part of the parameter, using some structural graph parameters incomparable with bandwidth. We show that if the feasibility is defined in MSO, then the reconfiguration problem under the so-called token jumping rule is fixed-parameter tractable parameterized by neighborhood diversity. We also show that the problem is fixed-parameter tractable parameterized by treedepth + k, where k is the size of sets being transformed. We finally complement the positive result for treedepth by showing that the problem is PSPACE-complete on forests of depth 3.

READ FULL TEXT

page 1

page 3

page 5

page 13

page 17

page 23

research
09/12/2022

On finding short reconfiguration sequences between independent sets

Assume we are given a graph G, two independent sets S and T in G of size...
research
05/03/2023

Approximate Evaluation of Quantitative Second Order Queries

Courcelle's theorem and its adaptations to cliquewidth have shaped the f...
research
09/05/2022

Resolving Infeasibility of Linear Systems: A Parameterized Approach

Deciding feasibility of large systems of linear equations and inequaliti...
research
09/21/2021

Fine-grained Meta-Theorems for Vertex Integrity

Vertex Integrity is a graph measure which sits squarely between two more...
research
03/26/2020

On Structural Parameterizations of Node Kayles

Node Kayles is a well-known two-player impartial game on graphs: Given a...
research
05/01/2019

Independent Set Reconfiguration Parameterized by Modular-Width

Independent Set Reconfiguration is one of the most well-studied problems...
research
11/20/2020

Fixed-Parameter Algorithms for Graph Constraint Logic

Non-deterministic constraint logic (NCL) is a simple model of computatio...

Please sign up or login with your details

Forgot password? Click here to reset