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

密度至关重要:删除边以限制子图密度的复杂性二元性

Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density

Technische Universität Berlin(柏林工业大学);University of Bergen(卑尔根大学)

Matthias Bentert, Tom-Lukas Breitkopf, Vincent Froese, Anton Herrmann, André Nichterlein

AI总结:

研究通过分析删除边以限制子图密度的问题,揭示了不同目标密度下的复杂性二元性,提出多项式时间算法及固定参数可解性方法。

摘要:

我们研究了τ-有界密度边删除(τ-BDED)问题,即给定一个无向图G,任务是删除尽可能少的边,以得到一个图G',使得G'中没有子图的密度超过τ。子图的密度是边数除以顶点数。该问题最近被引入并证明对于τ∈{2/3, 3/4, 1 + 1/25}时是NP难的,但对于τ∈{0,1/2,1}时是多项式时间可解的[Bazgan等,JCSS 2025]。我们针对目标密度τ提供了完整的二元性:1. 如果2τ∈N(半整数目标密度)或τ<2/3,则τ-BDED是多项式时间可解的。2. 否则,τ-BDED是NP难的。我们还通过G的树宽来补充NP难性,给出了固定参数可解性。此外,对于整数目标密度τ∈N,我们证明τ-BDED可以在随机O(m^{1 + o(1)})时间内解决。我们的算法结果基于将问题转化为一个新的受限网络上的通用流问题,该问题根据τ的不同,可通过最大s-t流或一般因子解决。我们相信这些流和匹配变种之间的联系具有独立兴趣。

英文摘要:

We study $τ$-Bounded-Density Edge Deletion ($τ$-BDED), where given an undirected graph $G$, the task is to remove as few edges as possible to obtain a graph $G'$ where no subgraph of $G'$ has density more than $τ$. The density of a (sub)graph is the number of edges divided by the number of vertices. This problem was recently introduced and shown to be NP-hard for $τ\in \{2/3, 3/4, 1 + 1/25\}$, but polynomial-time solvable for $τ\in \{0,1/2,1\}$ [Bazgan et al., JCSS 2025]. We provide a complete dichotomy with respect to the target density $τ$: 1. If $2τ\in \mathbb{N}$ (half-integral target density) or $τ< 2/3$, then $τ$-BDED is polynomial-time solvable. 2. Otherwise, $τ$-BDED is NP-hard. We complement the NP-hardness with fixed-parameter tractability with respect to the treewidth of $G$. Moreover, for integral target density $τ\in \mathbb{N}$, we show $τ$-BDED to be solvable in randomized $O(m^{1 + o(1)})$ time. Our algorithmic results are based on a reduction to a new general flow problem on restricted networks that, depending on $τ$, can be solved via Maximum s-t-Flow or General Factors. We believe this connection between these variants of flow and matching to be of independent interest.

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

↑