DeepAI AI Chat
Log In Sign Up

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

by   Stefan Ehard, et al.

A widely studied model for influence diffusion in social networks are target sets. For a graph G and an integer-valued threshold function τ on its vertex set, a target set or dynamic monopoly is a set of vertices of G such that iteratively adding to it vertices u of G that have at least τ(u) neighbors in it eventually yields the entire vertex set of G. This notion is limited to the binary choice of including a vertex in the target set or not, and Cordasco et al. proposed partial incentives as a variant allowing for intermediate choices. We show that finding optimal partial incentives is hard for chordal graphs and planar graphs but tractable for graphs of bounded treewidth and for interval graphs with bounded thresholds. We also contribute some new results about target set seletion on planar graphs by showing the hardness of this problem, and by describing an efficient O(√(n))-approximation algorithm as well as a PTAS for the dual problem of finding a maximum degenerate set.


page 1

page 2

page 3

page 4


Dynamic monopolies for interval graphs with bounded thresholds

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

On Reconfigurability of Target Sets

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

Target set selection with maximum activation time

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

Solving Target Set Selection with Bounded Thresholds Faster than 2^n

In this paper we consider the Target Set Selection problem. The problem ...

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

Target Set Selection Parameterized by Clique-Width and Maximum Threshold

The Target Set Selection problem takes as an input a graph G and a non-n...

Fast and Error-Adaptive Influence Maximization based on Count-Distinct Sketches

Influence maximization (IM) is the problem of finding a seed vertex set ...