arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.00161cs.DScs.CCcs.DMmath.CO
收藏

诱导子式模型 II:多项式时间检测诱导子式的充分条件

Induced Minor Models. II. Sufficient conditions for polynomial-time detection of induced minors

University of Fribourg(弗里堡大学);University of Warsaw(华沙大学);University of Primorska(滨海大学);Université d’Orléans(奥尔良大学);INSA Centre Val de Loire(中央卢瓦尔河谷国立应用科学学院)

Clément Dallard, Maël Dumas, Claire Hilaire, Anthony Perez

AI总结:

该研究针对$H$-诱导子式包含问题($H$-IMC)的计算复杂性,探究图$H$的性质与多项式时间求解的关联,确定四类满足条件的无限图族,还证明输入图不含长诱导路径时该问题对任意固定$H$可多项式时间求解,并推出顶点数≤5的图中仅三个情形仍未决。

摘要:

$H$-诱导子式包含问题($H$-IMC)旨在判定固定图$H$是否为输入图$G$的诱导子式,即能否通过删除顶点和收缩边从$G$得到$H$。等价地,该问题询问$G$中是否存在$H$的诱导子式模型,也就是一组互不相交的$G$的顶点子集,每个子集诱导出一个连通子图,将每个子图收缩为单个顶点后得到$H$。\n 已知对于若干图$H$,即便$H$是树,$H$-IMC都是NP完全的。本研究中,我们探究$H$的哪些性质能保证存在一种诱导子式模型,其结构可被利用以在多项式时间内求解该问题。借此我们确定了四类满足此类性质的无限图族$H$。此外,我们证明若输入图$G$不含长诱导路径,则对任意固定图$H$,$H$-IMC均可在多项式时间内求解。作为研究结果的推论,这意味着除三个未决情形外,对于所有顶点数不超过5的图$H$,$H$-IMC均可在多项式时间内求解。

英文摘要:

The $H$-Induced Minor Containment problem ($H$-IMC) consists in deciding if a fixed graph $H$ is an induced minor of a graph $G$ given as input, that is, whether $H$ can be obtained from $G$ by deleting vertices and contracting edges. Equivalently, the problem asks if there exists an induced minor model of $H$ in $G$, that is, a collection of disjoint subsets of vertices of $G$, each inducing a connected subgraph, such that contracting each subgraph into a single vertex results in $H$. It is known that $H$-IMC is NP-complete for several graphs $H$, even when $H$ is a tree. In this work, we investigate which properties of $H$ guarantee the existence of an induced minor model whose structure can be leveraged to solve the problem in polynomial time. This allows us to identify four infinite families of graphs $H$ that enjoy such properties. Moreover, we show that if the input graph $G$ excludes long induced paths, then $H$-IMC is polynomial-time solvable for any fixed graph $H$. As a byproduct of our results, this implies that $H$-IMC is polynomial-time solvable for all graphs $H$ with at most $5$ vertices, except for three open cases.

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

↑