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

1-独立集的可拓性

1-Extendability of independent sets

Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant

摘要:

在70年代,Berge引入了1-可扩图(也称为B-图),它是每个顶点都属于一个最大独立集的图。基于无线网络设计中的一个应用,我们研究了1-可扩性的计算复杂性,即判定图是否是1-可扩的问题。我们表明,在一般情况下,1-可扩展性不能解决在$2^{o(n)}$时间假设的指数时间假设,其中$n$是输入图的顶点数,它仍然是NP-硬在次立方平面图和单位盘图(这是一个自然的模型无线网络)。虽然1-可拓性似乎非常接近于找到一个最大大小的独立集的问题(也称为“独立集”)。最大独立集),我们发现,有趣的是,存在1-可扩图的最大独立集是NP-困难的。最后,我们研究了1-可扩性的参数化版本。

英文摘要:

In the 70s, Berge introduced 1-extendable graphs (also called B-graphs), which are graphs where every vertex belongs to a maximum independent set. Motivated by an application in the design of wireless networks, we study the computational complexity of 1-extendability, the problem of deciding whether a graph is 1-extendable. We show that, in general, 1-extendability cannot be solved in $2^{o(n)}$ time assuming the Exponential Time Hypothesis, where $n$ is the number of vertices of the input graph, and that it remains NP-hard in subcubic planar graphs and in unit disk graphs (which is a natural model for wireless networks). Although 1-extendability seems to be very close to the problem of finding an independent set of maximum size (a.k.a. Maximum Independent Set), we show that, interestingly, there exist 1-extendable graphs for which Maximum Independent Set is NP-hard. Finally, we investigate a parameterized version of 1-extendability.

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

↑