一般图的不可逆动态垄断
On irreversible dynamic monopolies in general graphs
摘要:
考虑以下在具有正度数的简单有向图$G(V,E)$中的着色过程。最初,一组$S$顶点是白色的,而所有其他顶点都是黑色的。此后,只要一个黑色顶点的内邻顶点中有一半以上是白色的,它就被着色为白色。当没有其他顶点可以被着色为白色时,着色过程结束。如果所有的顶点都是白色的,我们称$S$为严格多数情形下的不可逆动态垄断(或简称发电机)。简单多数情形下的不可逆发电机的定义类似,只是当至少一半的内邻居是白色时,黑色顶点被涂成白色。在严格多数和简单多数情形下,分别得到了不可逆发电机最小规模的上界$(2/3)\,|\,V\,|$和$|\,V\,|/2$.对于$G$是无向连通图的特殊情形,在严格多数情形下,证明了不可逆发电机的存在性,其大小至多为$\lceil |\,V\,|/2 \rceil$.设$ε>0$为任意常数。我们还表明,除非$\text{NP}\subseteq \text{TIME}(n^{O(\ln \ln n)}),$没有多项式时间,$((1/2-ε)\ln |\,V\,|)$-近似算法存在的最小不可逆发电机下的严格或简单多数的情况下。不可逼近性的结果甚至适用于直径不超过8的二部图。
英文摘要:
Consider the following coloring process in a simple directed graph $G(V,E)$ with positive indegrees. Initially, a set $S$ of vertices are white, whereas all the others are black. Thereafter, a black vertex is colored white whenever more than half of its in-neighbors are white. The coloring process ends when no additional vertices can be colored white. If all vertices end up white, we call $S$ an irreversible dynamic monopoly (or dynamo for short) under the strict-majority scenario. An irreversible dynamo under the simple-majority scenario is defined similarly except that a black vertex is colored white when at least half of its in-neighbors are white. We derive upper bounds of $(2/3)\,|\,V\,|$ and $|\,V\,|/2$ on the minimum sizes of irreversible dynamos under the strict and the simple-majority scenarios, respectively. For the special case when $G$ is an undirected connected graph, we prove the existence of an irreversible dynamo with size at most $\lceil |\,V\,|/2 \rceil$ under the strict-majority scenario. Let $ε>0$ be any constant. We also show that, unless $\text{NP}\subseteq \text{TIME}(n^{O(\ln \ln n)}),$ no polynomial-time, $((1/2-ε)\ln |\,V\,|)$-approximation algorithms exist for finding the minimum irreversible dynamo under either the strict or the simple-majority scenario. The inapproximability results hold even for bipartite graphs with diameter at most 8.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。