arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2308.04795cs.DSmath.CO
收藏

无诱导子式图:分离定理、次指数算法与识别问题改进的困难性

Induced-Minor-Free Graphs: Separator Theorem, Subexponential Algorithms, and Improved Hardness of Recognition

Tuukka Korhonen, Daniel Lokshtanov

AI总结:

本文证明无诱导子式图具有大小为 $O_H(\sqrt{m})$ 的平衡顶点分离器,并据此为最大独立集等问题给出次指数时间算法,同时证明存在固定树 $T$ 使诱导子式检测在 ETH 下无 $2^{o(n/\log^3 n)}$ 算法,从而解决一个开放问题。

摘要:

若图 $H$ 可以通过对图 $G$ 进行顶点删除和边收缩得到,则称图 $G$ 包含图 $H$ 作为诱导子式。$H$-无诱导子式图类推广了 $H$-无子式图类,但与 $H$-无子式图不同,它可以包含稠密图。我们证明,如果一个具有 $n$ 个顶点、$m$ 条边的图 $G$ 不包含图 $H$ 作为诱导子式,则它有一个大小为 $O_{H}(\sqrt{m})$ 的平衡顶点分离器,其中 $O_{H}(\cdot)$ 记号隐藏了依赖于 $H$ 的因子。更精确地说,我们对平衡分离器大小的上界是 $O(\min(|V(H)|^2, \log n) \cdot \sqrt{|V(H)|+|E(H)|} \cdot \sqrt{m})$。我们给出了一个随机多项式时间算法,用于在 $G$ 中找到 $H$ 的诱导子式模型或找到这样的分离器。我们将其应用于在 $H$-无诱导子式图上获得次指数时间 $2^{O_{H}(n^{2/3} \log n)}$ 算法,适用于一大类问题,包括最大独立集、最小反馈顶点集、3-着色和平面化。对于每条边都与一个度数至多为 2 的顶点相关联的图 $H$,我们的结果蕴含了一个 $2^{O_{H}(n^{2/3} \log n)}$ 时间算法,用于测试 $G$ 是否包含 $H$ 作为诱导子式。我们的第二个主要结果是,存在一棵固定的树 $T$,使得除非指数时间假设(ETH)不成立,否则不存在 $2^{o(n/\log^3 n)}$ 时间算法来测试给定的 $n$ 顶点图是否包含 $T$ 作为诱导子式。我们的归约还给出了 NP 困难性,这解决了 Fellows、Kratochvíl、Middendorf 和 Pfeiffer [Algorithmica, 1995] 提出的一个开放问题,他们问是否存在一个固定的平面图 $H$,使得测试 $H$ 作为诱导子式是 NP 困难的。

英文摘要:

A graph $G$ contains a graph $H$ as an induced minor if $H$ can be obtained from $G$ by vertex deletions and edge contractions. The class of $H$-induced-minor-free graphs generalizes the class of $H$-minor-free graphs, but unlike $H$-minor-free graphs, it can contain dense graphs. We show that if an $n$-vertex $m$-edge graph $G$ does not contain a graph $H$ as an induced minor, then it has a balanced vertex separator of size $O_{H}(\sqrt{m})$, where the $O_{H}(\cdot)$-notation hides factors depending on $H$. More precisely, our upper bound for the size of the balanced separator is $O(\min(|V(H)|^2, \log n) \cdot \sqrt{|V(H)|+|E(H)|} \cdot \sqrt{m})$. We give an algorithm for finding either an induced minor model of $H$ in $G$ or such a separator in randomized polynomial-time. We apply this to obtain subexponential $2^{O_{H}(n^{2/3} \log n)}$ time algorithms on $H$-induced-minor-free graphs for a large class of problems including maximum independent set, minimum feedback vertex set, 3-coloring, and planarization. For graphs $H$ where every edge is incident to a vertex of degree at most 2, our results imply a $2^{O_{H}(n^{2/3} \log n)}$ time algorithm for testing if $G$ contains $H$ as an induced minor. Our second main result is that there exists a fixed tree $T$, so that there is no $2^{o(n/\log^3 n)}$ time algorithm for testing if a given $n$-vertex graph contains $T$ as an induced minor unless the Exponential Time Hypothesis (ETH) fails. Our reduction also gives NP-hardness, which solves an open problem asked by Fellows, Kratochvíl, Middendorf, and Pfeiffer [Algorithmica, 1995], who asked if there exists a fixed planar graph $H$ so that testing for $H$ as an induced minor is NP-hard.

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

↑