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

双图中不相交覆盖的s-俱乐部

Disjoint covering of bipartite graphs with $s$-clubs

Sapienza University of Rome(罗马智慧大学);Luiss University(卢意斯大学)

Angelo Monti, Blerina Sinaimeri

AI总结:

研究双图中将顶点划分或覆盖为s-俱乐部的问题,证明了(k,s)-PC问题在某些条件下为NP难,同时解决了(t,2)-MAX-DCC的多项式时间算法问题。

摘要:

对于正整数s,图G中的s-俱乐部是诱导子图直径不超过s的顶点集合。本文研究了双图中将顶点划分或覆盖为s-俱乐部的问题。首先考虑(k,s)-PC问题,即是否能将G的顶点划分为至多k个不相交的s-俱乐部。证明对于任何固定的k≥2和任何固定的奇数s≥3或偶数s≥8,(k,s)-PC问题在双图上是NP难的。此外,研究了最大不相交(t,s)-俱乐部覆盖问题((t,s)-MAX-DCC),旨在找到覆盖G中最多顶点的不相交(t,s)-俱乐部集合。证明对于任何固定的t≥8,(t,3)-MAX-DCC问题无法在95/94的近似因子内解决,对于任何固定的t≥5,(t,2)-MAX-DCC问题同样NP难。最后,为(t,2)-MAX-DCC问题提供了一个多项式时间算法,解决了Dondi等人(2019)提出的一个开放问题。

英文摘要:

For a positive integer $s$, an $s$-club in a graph $G$ is a set of vertices inducing a subgraph with diameter at most $s$. As generalizations of cliques, $s$-clubs offer a flexible model for real-world networks. This paper addresses the problems of partitioning and disjoint covering of vertices with $s$-clubs on bipartite graphs. First we consider the $(k,s)$-PC problem where ask whether the vertices of $G$ can be partitioned into at most $k$ disjoint $s$-clubs. We prove that for any fixed $k \geq 2$ and for any fixed odd $s \geq 3$ or even $s\geq 8$, the $(k,s)$-PC problem is NP-complete even for bipartite graphs. Note that our NP-completeness result is stronger than the one in Abbas and Stewart (1999), as we assume that both $s$ and $k$ are constants and not part of the input. Additionally, we study the Maximum Disjoint $(t,s)$-Club Covering problem ($(t,s)$-MAX-DCC), which aims to find a collection of vertex-disjoint $(t,s)$-clubs (i.e. $s$-clubs with at least $t$ vertices) that covers the maximum number of vertices in $G$. We prove that it is NP-hard to achieve an approximation factor of $\frac{95}{94} $ for $(t,3)$-MAX-DCC for any fixed $t\geq 8$ and for $(t,2)$-MAX-DCC for any fixed $t\geq 5$ even for bipartite graphs. Previously, results were known only for $(3,2)$-MAX-DCC. Finally, we provide a polynomial-time algorithm for $(2,2)$-MAX-DCC resolving an open problem from Dondi \textit{et al.} (2019).

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

↑