arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2201.05252cs.DMcs.ITmath.IT
收藏

冗余开定位支配集的NP完全性

The NP-completeness of Redundant Open-Locating-Dominating Set

Robert Dohner, Suk Jai Seo

摘要:

对于图G,支配集D是G中的顶点的子集,其中G中的每个顶点都在D中或与D中的某个顶点相邻。开放定位支配(OLD)集模型的系统与传感器检测入侵者的设施或处理器网络中的故障组件。其目标是在一个系统中用最少的传感器检测并精确定位入侵者的确切位置。在本文中,我们专注于一个变种的OLD集称为冗余OLD集,并提供了一个证明的NP-完全性问题的冗余OLD集。

英文摘要:

For a graph G, a dominating set D is a subset of vertices in G where each of the vertices in G is in D or adjacent to some vertex in D. An open-locating-dominating (OLD) set models a system with sensors to detect an intruder in a facility or a faulty component in a network of processors. The goal is to detect and pinpoint an intruder's exact location in a system with a minimum number of sensors. In this paper, we focus on a variant of an OLD set called a redundant OLD set and present a proof for the NP-completeness of the problem of a redundant OLD set.

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

↑