Parameterized Complexity of Weighted Target Set Selection

Abstract

Consider a graph G where each vertex has a threshold. A vertex v in G is activated if the number of active vertices adjacent to v is at least as many as its threshold. A vertex subset $A_{0}$ of G is a target set if eventually all vertices in G are activated by initially activating vertices of $A_{0}$. The Target Set Selection problem (TSS) involves finding the smallest target set of G with vertex thresholds. This problem has already been extensively studied and is known to be NP-hard even for very restricted conditions. In this paper, we analyze TSS and its weighted variant, called the Weighted Target Set Selection problem (WTSS) from the perspective of parameterized complexity. Let k be the solution size and $\ell$ be the maximum threshold. We first show that TSS is W[1]-hard for split graphs when parameterized by $k + \ell$, and W[2]-hard for cographs when parameterized by k. We also prove that WTSS is W[2]-hard for trivially perfect graphs when parameterized by k. On the other hand, we show that WTSS can be solved in $O(n \log n)$ time for complete graphs. Additionally, we design FPT algorithms for WTSS when parameterized by $\textsf{nd}+\ell$, $\textsf{tw}+\ell$, $\textsf{ce}$, and $\textsf{vc}$, where $\textsf{nd}$ is the neighborhood diversity, $\textsf{tw}$ is the treewidth, $\textsf{ce}$ is the cluster editing number, and $\textsf{vc}$ is the vertex cover number of the input graph.

A. Suzuki—Partially supported by JSPS KAKENHI Grant Number JP20K11666, Japan.

Y. Tamura—Partially supported by JSPS KAKENHI Grant Number JP21K21278, Japan.