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

切换类:刻画与计算

Switching Classes: Characterization and Computation

Dhanyamol Antony, Yixin Cao, Sagartanu Pal, R. B. Sandeep

AI总结:

本文研究遗传图类在切换操作下封闭的最大子类与最小超类,刻画了多类图的最大子类性质,给出部分图类最小超类的多项式识别算法,并证明长路径/环的H-free图超类识别为NP完全且次指数时间不可解。

摘要:

在图论中,切换操作会反转一个顶点子集与其余顶点之间的邻接关系。对于遗传图类$\u2702$,我们关注$\u2702$在切换操作下封闭的最大子类和最小超类。我们对许多重要图类$\u2702$的最大子类进行了刻画,并证明当$\u2702$是子式封闭且至少排除一个图时,该最大子类是有限的。针对若干图类,我们开发了多项式时间算法来识别最小超类。我们还表明,当$H$是足够长的路径或环时,$H$-free图的超类识别问题是NP完全的,并且在指数时间假设(Exponential Time Hypothesis)下,该问题无法在次指数时间内求解。

英文摘要:

In a graph, the switching operation reverses adjacencies between a subset of vertices and the others. For a hereditary graph class $\mathcal{G}$, we are concerned with the maximum subclass and the minimum superclass of $\mathcal{G}$ that are closed under switching. We characterize the maximum subclass for many important classes $\mathcal{G}$, and prove that it is finite when $\mathcal{G}$ is minor-closed and omits at least one graph. For several graph classes, we develop polynomial-time algorithms to recognize the minimum superclass. We also show that the recognition of the superclass is NP-complete for $H$-free graphs when $H$ is a sufficiently long path or cycle, and it cannot be solved in subexponential time assuming the Exponential Time Hypothesis.

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

↑