arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.03959math.COcs.DM
收藏

阈值限制为 $0$、$1$ 和顶点度的非单调目标集

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

Julien Baste, Stefan Ehard, Dieter Rautenbach

AI总结:

本文针对阈值仅取0、1或顶点度的非单调激活过程,刻画了目标集,证明树上有高效算法,而最大度为3的平面图仍NP难,但有界树宽图可高效求解。

摘要:

我们考虑图 $G$ 上的一个非单调激活过程 $(X_t)_{t\in\{0,1,2,\ldots\}}$,其中 $X_0\subseteq V(G)$,且对每个正整数 $t$,$X_t=\{u\in V(G):|N_G(u)\cap X_{t-1}|\geq τ(u)\}$,这里 $τ:V(G)\to \mathbb{Z}$ 是一个阈值函数。若存在某个 $t_0$ 使得对所有 $t\geq t_0$ 都有 $X_t=V(G)$,则集合 $X_0$ 被称为 $(G,τ)$ 的非单调目标集。Ben-Zwi、Hermelin、Lokshtanov 和 Newman [Discrete Optimization 8 (2011) 87-96] 曾提出:当 $G$ 是树时,能否高效确定最小阶的目标集。对于满足每个顶点 $u$ 都有 $τ(u)\in\{0,1,d_G(u)\}$ 的阈值函数 $τ$,我们给出了肯定回答。对于这类受限阈值函数,我们给出了目标集的一个刻画,由此可以证明:最小目标集问题在最大度为 $3$ 的平面图上仍是 NP-难的,但在有界树宽的图上可以高效求解。

英文摘要:

We consider a non-monotone activation process $(X_t)_{t\in\{ 0,1,2,\ldots\}}$ on a graph $G$, where $X_0\subseteq V(G)$, $X_t=\{ u\in V(G):|N_G(u)\cap X_{t-1}|\geq τ(u)\}$ for every positive integer $t$, and $τ:V(G)\to \mathbb{Z}$ 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\geq 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)\in \{ 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 planar graphs of maximum degree $3$ but is efficiently solvable for graphs of bounded treewidth.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑