DeepAI AI Chat
Log In Sign Up

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

by   Julien Baste, et al.

We consider a non-monotone activation process (X_t)_t∈{ 0,1,2,…} on a graph G, where X_0⊆ V(G), X_t={ u∈ V(G):|N_G(u)∩ X_t-1|≥τ(u)} for every positive integer t, and τ:V(G)→ℤ is a threshold function. The set X_0 is a so-called non-monotone target set for (G,τ) if there is some t_0 such that X_t=V(G) for every t≥ t_0. Ben-Zwi, Hermelin, Lokshtanov, and Newman [Discrete Optimization 8 (2011) 87-96] asked whether a target set of minimum order can be determined efficiently if G is a tree. We answer their question in the affirmative for threshold functions τ satisfying τ(u)∈{ 0,1,d_G(u)} for every vertex u. For such restricted threshold functions, we give a characterization of target sets that allows to show that the minimum target set problem remains NP-hard for graphs of maximum degree 4 but is efficiently solvable for graphs of bounded treewidth.


page 1

page 2

page 3

page 4


Target set selection with maximum activation time

A target set selection model is a graph G with a threshold function τ:V→...

On Reconfigurability of Target Sets

We study the problem of deciding reconfigurability of target sets of a g...

Dynamic monopolies for interval graphs with bounded thresholds

For a graph G and an integer-valued threshold function τ on its vertex s...

Min (A)cyclic Feedback Vertex Sets and Min Ones Monotone 3-SAT

In directed graphs, we investigate the problems of finding: 1) a minimum...

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...