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

动态图的控制集与连通控制集

Dominating Sets and Connected Dominating Sets in Dynamic Graphs

Niklas Hjuler, Giuseppe F. Italiano, Nikos Parotsidis, David Saulpic

摘要:

本文研究了两个基本图问题的动态形式:最小支配集及其变体最小连通支配集。对于这两个问题,我们提出的算法,保持一个解决方案下的边插入和边删除的时间$O(Δ\cdot \text{polylog}~n)$每次更新,其中$Δ$是在图中的最大顶点度。在这两种情况下,我们实现了近似比$O(\log n)$,这是最佳的常数因子(假设$P \ne NP$)。虽然这两个问题已被广泛研究的静态和分布式设置,据我们所知,我们是第一个提出有效的算法在动态设置。作为我们的方法的进一步应用,我们还提出了一个算法,保持在$O(min(Δ, \sqrt{m}))$每次更新的最小支配集。

英文摘要:

In this paper we study the dynamic versions of two basic graph problems: Minimum Dominating Set and its variant Minimum Connected Dominating Set. For those two problems, we present algorithms that maintain a solution under edge insertions and edge deletions in time $O(Δ\cdot \text{polylog}~n)$ per update, where $Δ$ is the maximum vertex degree in the graph. In both cases, we achieve an approximation ratio of $O(\log n)$, which is optimal up to a constant factor (under the assumption that $P \ne NP$). Although those two problems have been widely studied in the static and in the distributed settings, to the best of our knowledge we are the first to present efficient algorithms in the dynamic setting. As a further application of our approach, we also present an algorithm that maintains a Minimal Dominating Set in $O(min(Δ, \sqrt{m}))$ per update.

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

↑