Papers
Topics
Authors
Recent
Search
2000 character limit reached

Target set selection with maximum activation time

Published 10 Jul 2020 in cs.DS, cs.CC, and math.CO | (2007.05246v1)

Abstract: A target set selection model is a graph GG with a threshold function τ:V→N\tau:V\to \mathbb{N} upper-bounded by the vertex degree. For a given model, a set S0⊆V(G)S_0\subseteq V(G) is a target set if V(G)V(G) can be partitioned into non-empty subsets S0,S1,…,StS_0,S_1,\dotsc,S_t such that, for i∈{1,…,t}i \in \{1, \ldots, t\}, SiS_i contains exactly every vertex vv having at least τ(v)\tau(v) neighbors in S0∪⋯∪Si−1S_0\cup\dots\cup S_{i-1}. We say that tt is the activation time tτ(S0)t_{\tau}(S_0) of the target set S0S_0. The problem of, given such a model, finding a target set of minimum size has been extensively studied in the literature. In this article, we investigate its variant, which we call TSS-time, in which the goal is to find a target set S0S_0 that maximizes tτ(S0)t_{\tau}(S_0). That is, given a graph GG, a threshold function τ\tau in GG, and an integer kk, the objective of the TSS-time problem is to decide whether GG contains a target set S0S_0 such that tτ(S0)≥kt_{\tau}(S_0)\geq k. Let τ∗=max⁡v∈V(G)τ(v)\tau^* = \max_{v \in V(G)} \tau(v). Our main result is the following dichotomy about the complexity of TSS-time when GG belongs to a minor-closed graph class C{\cal C}: if C{\cal C} has bounded local treewidth, the problem is FPT parameterized by kk and τ⋆\tau^{\star}; otherwise, it is NP-complete even for fixed k=4k=4 and τ⋆=2\tau^{\star}=2. We also prove that, with τ∗=2\tau^*=2, the problem is NP-hard in bipartite graphs for fixed k=5k=5, and from previous results we observe that TSS-time is NP-hard in planar graphs and W[1]-hard parameterized by treewidth. Finally, we present a linear-time algorithm to find a target set S0S_0 in a given tree maximizing tτ(S0)t_{\tau}(S_0).

Citations (5)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.