arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2004.09938cs.CCcs.DMcs.DSmath.CO
收藏

诱导多部图参数的参数化复杂度研究

On the Parameterised Complexity of Induced Multipartite Graph Parameters

Ryan L. Mann, Luke Mathieson, Catherine Greenhill

AI总结:

该研究引入诱导多部图参数类,证明其最大值判定问题为W[1]-难,且其变体问题对部分参数为para-NP-难、对另一些为固定参数可处理,丰富了图参数复杂度理论。

摘要:

我们引入一类图参数,称为诱导多部图参数(induced multipartite graph parameters),并研究其计算复杂度。首先,我们考虑如下判定问题:实例为一个诱导多部图参数$p$和给定图$G$,对于自然数$k\neq2$且$\neq\neq$,我们需要判定$G$的所有诱导$k$-部子图上$p$的最大值是否至多为$\neq$。我们证明该问题是W[1]-难的。接下来,我们考虑该问题的一个变体:判定给定图$G$是否包含一个足够大的诱导$k$-部子图$H$,使得$p(H)\not=\neq$。我们表明,对于某些参数,该问题是para-NP-难的,而对于另一些参数,它是固定参数可处理的。

英文摘要:

We introduce a family of graph parameters, called induced multipartite graph parameters, and study their computational complexity. First, we consider the following decision problem: an instance is an induced multipartite graph parameter $p$ and a given graph $G$, and for natural numbers $k\geq2$ and $\ell$, we must decide whether the maximum value of $p$ over all induced $k$-partite subgraphs of $G$ is at most $\ell$. We prove that this problem is W[1]-hard. Next, we consider a variant of this problem, where we must decide whether the given graph $G$ contains a sufficiently large induced $k$-partite subgraph $H$ such that $p(H)\leq\ell$. We show that for certain parameters this problem is para-NP-hard, while for others it is fixed-parameter tractable.

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

↑