On Reconfigurability of Target Sets

by   Naoto Ohsaka, et al.

We study the problem of deciding reconfigurability of target sets of a graph. Given a graph G with vertex thresholds τ, consider a dynamic process in which vertex v becomes activated once at least τ(v) of its neighbors are activated. A vertex set S is called a target set if all vertices of G would be activated when initially activating vertices of S. In the Target Set Reconfiguration problem, given two target sets X and Y of the same size, we are required to determine whether X can be transformed into Y by repeatedly swapping one vertex in the current set with another vertex not in the current set preserving every intermediate set as a target set. In this paper, we investigate the complexity of Target Set Reconfiguration in restricted cases. On the hardness side, we prove that Target Set Reconfiguration is PSPACE-complete on bipartite planar graphs of degree 3 or 4 and of threshold 2, bipartite 3-regular graphs of threshold 1 or 2, and split graphs, which is in contrast to the fact that a special case called Vertex Cover Reconfiguration is in P for the last graph class. On the positive side, we present a polynomial-time algorithm for Target Set Reconfiguration on graphs of maximum degree 2 and trees. The latter result can be thought of as a generalization of that for Vertex Cover Reconfiguration.


Above guarantee parameterization for vertex cover on graphs with maximum degree 4

In the vertex cover problem, the input is a graph G and an integer k, an...

Target Set Selection for Conservative Populations

Let G = (V,E) be a graph on n vertices, where d_v denotes the degree of ...

On some tractable and hard instances for partial incentives and target set selection

A widely studied model for influence diffusion in social networks are t...

Non-monotone target sets for threshold values restricted to 0, 1, and the vertex degree

We consider a non-monotone activation process (X_t)_t∈{ 0,1,2,…} on a gr...

Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies

Let G be a graph and τ be an assignment of nonnegative integer threshold...

Stackelberg Vertex Cover on a Path

A Stackelberg Vertex Cover game is played on an undirected graph 𝒢 where...

The Power of Small Coalitions under Two-Tier Majority on Regular Graphs

In this paper, we study the following problem. Consider a setting where ...

Please sign up or login with your details

Forgot password? Click here to reset