arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2204.04765cs.DS
收藏

极小罗马控制函数:扩张与枚举

Minimal Roman Dominating Functions: Extensions and Enumeration

Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann

摘要:

罗马控制是控制的许多变体之一,它保留了经典控制问题的大部分复杂性特征。我们证明了罗马统治在两个方面的不同表现:枚举和扩展。我们发展了多项式时滞和多项式空间的极小罗马控制函数的非平凡枚举算法。回想一下,关于极小控制集的类似枚举结果的存在性已经公开了几十年。我们的结果是基于一个多项式时间算法的扩展罗马控制:给定一个图$G = (V,E)$和一个函数$f:V\to\{0,1,2\}$,是否有一个最小罗马控制函数$\Tilde{f}$与$f\leq \Tilde{f}$?在这里,$\leq$逐点提升了$0< 1< 2$;最小性是按照这个顺序理解的。我们的枚举算法也从输入敏感的角度进行了分析,导致运行时估计的$\Oh(\RomanUpperbound^n)$为n阶的图形,这是补充的下限例子$Ω(\RomanLowerbound^n)$。

英文摘要:

Roman domination is one of the many variants of domination that keeps most of the complexity features of the classical domination problem. We prove that Roman domination behaves differently in two aspects: enumeration and extension. We develop non-trivial enumeration algorithms for minimal Roman domination functions with polynomial delay and polynomial space. Recall that the existence of a similar enumeration result for minimal dominating sets is open for decades. Our result is based on a polynomial-time algorithm for Extension Roman Domination: Given a graph $G = (V,E)$ and a function $f:V\to\{0,1,2\}$, is there a minimal Roman domination function $\Tilde{f}$ with $f\leq \Tilde{f}$? Here, $\leq$ lifts $0< 1< 2$ pointwise; minimality is understood in this order. Our enumeration algorithm is also analyzed from an input-sensitive viewpoint, leading to a run-time estimate of $\Oh(\RomanUpperbound^n)$ for graphs of order n; this is complemented by a lower bound example of $Ω(\RomanLowerbound^n)$.

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

↑