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

编辑为欧拉图

Editing to Eulerian Graphs

Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, Daniël Paulusma

摘要:

研究了将一个图修改为连通图的问题,其中每个顶点的度满足给定的奇偶约束。设$ea$、$ed$和$vd$分别表示边添加、边删除和顶点删除操作。对于任何$S\subseteq \{ea,ed,vd\}$,我们定义连接度奇偶校验编辑$(S)$(CDPE($S$))的问题,作为输入的图形$G$,一个整数$k$和一个功能$δ\colon V(G)\rightarrow\{0,1\}$,并询问是否$G$可以被修改为连接图$H$与$d_{H}(v)\equivδ(v)~(\bmod~2)$为每个$v\in V(H)$,使用最多$k$操作从$S$。我们证明了1。如果$S=\{ea\}$或$S=\{ea,ed\}$,则CDPE($S$)可以在多项式时间内求解; 2.如果是$\{vd\} \subseteq S\subseteq \{ea,ed,vd\}$,则CDPE($S$)是NP-完全的,并且当由$k$参数化时是W[1]-困难的,即使是$δ\equiv 0$。结合蔡和杨以及Cygan,Marx,Pilipczuk,Pilipczuk和Schlotter的已知结果,我们的结果对所有$S\subseteq \{ea,ed,vd\}$的CDPE($S$)问题的经典复杂性和参数化复杂性进行了完全分类.我们得到了相同的分类的自然变种的CDPE($S$)问题的有向图,其中的目标是一个弱连通的有向图,其中的每个顶点的入度和出度之间的差异等于一个规定的值。作为我们的结果的一个重要含义,我们得到了多项式时间算法的欧拉编辑问题及其有向变种。

英文摘要:

We investigate the problem of modifying a graph into a connected graph in which the degree of each vertex satisfies a prescribed parity constraint. Let $ea$, $ed$ and $vd$ denote the operations edge addition, edge deletion and vertex deletion respectively. For any $S\subseteq \{ea,ed,vd\}$, we define Connected Degree Parity Editing$(S)$ (CDPE($S$)) to be the problem that takes as input a graph $G$, an integer $k$ and a function $δ\colon V(G)\rightarrow\{0,1\}$, and asks whether $G$ can be modified into a connected graph $H$ with $d_{H}(v)\equivδ(v)~(\bmod~2)$ for each $v\in V(H)$, using at most $k$ operations from $S$. We prove that 1. if $S=\{ea\}$ or $S=\{ea,ed\}$, then CDPE($S$) can be solved in polynomial time; 2. if $\{vd\} \subseteq S\subseteq \{ea,ed,vd\}$, then CDPE($S$) is NP-complete and W[1]-hard when parameterized by $k$, even if $δ\equiv 0$. Together with known results by Cai and Yang and by Cygan, Marx, Pilipczuk, Pilipczuk and Schlotter, our results completely classify the classical and parameterized complexity of the CDPE($S$) problem for all $S\subseteq \{ea,ed,vd\}$. We obtain the same classification for a natural variant of the CDPE($S$) problem on directed graphs, where the target is a weakly connected digraph in which the difference between the in- and out-degree of every vertex equals a prescribed value. As an important implication of our results, we obtain polynomial-time algorithms for the Eulerian Editing problem and its directed variant.

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

↑