arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1508.02773cs.DScs.CC
收藏

给定度平面图的编辑

Editing to a Planar Graph of Given Degrees

Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniel Paulusma, Dimitrios M. Thilikos

摘要:

我们考虑下面的图形修改问题。令输入由图$G=(V,E)$、权重函数$w\colon V\cup E\rightarrow \mathbb{N}$、成本函数$c\colon V\cup E\rightarrow \mathbb{N}$和度函数$δ\colon V\rightarrow \mathbb{N}_0$以及三个整数$k_v, k_e$和$C$组成。问题是我们是否可以删除一组总重量至多为$k_v$的顶点和一组总重量至多为$k_e$的边,使得删除元素的总成本至多为$C$,并且每个未删除的顶点$v$在所得图$G'$中具有度$δ(v)$。我们还考虑了$G'$必须连接的变体。当用$k_v+k_e$参数化时,这两个问题都是NP完全的和W[1]-困难的。我们证明,当限制到平面图,他们保持NP-完全,但有多项式内核时,参数化$k_v+k_e$。

英文摘要:

We consider the following graph modification problem. Let the input consist of a graph $G=(V,E)$, a weight function $w\colon V\cup E\rightarrow \mathbb{N}$, a cost function $c\colon V\cup E\rightarrow \mathbb{N}$ and a degree function $δ\colon V\rightarrow \mathbb{N}_0$, together with three integers $k_v, k_e$ and $C$. The question is whether we can delete a set of vertices of total weight at most $k_v$ and a set of edges of total weight at most $k_e$ so that the total cost of the deleted elements is at most $C$ and every non-deleted vertex $v$ has degree $δ(v)$ in the resulting graph $G'$. We also consider the variant in which $G'$ must be connected. Both problems are known to be NP-complete and W[1]-hard when parameterized by $k_v+k_e$. We prove that, when restricted to planar graphs, they stay NP-complete but have polynomial kernels when parameterized by $k_v+k_e$.

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

↑