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

共图编辑:合并模块相当于编辑P4的

Cograph Editing: Merging Modules is equivalent to Editing P4's

Marc Hellmuth, Adrian Fritz, Nicolas Wieseke, Peter F. Stadler

摘要:

图$G=(V,E)$的模分解不包含素模当且仅当$G$是一个余图,也就是说,如果没有四重顶点导出一条简单连通路$P_4$。上图编辑问题是在$G$中插入和删除一组$F$的边缘,使$H=(V,EΔF)$是一个上图和$|F|$是最小的。这个NP难的组合优化问题最近已经得到应用,例如,in the context背景of autogenetics遗传学.因此,高效的物流具有实际重要性。根据其模块分解,对上图的简单表征表明,可以直接对模块分解进行操作,而不是编辑$G$。我们在这里表明,编辑诱导的$P_4$ s是等价于解决素模块通过一个合适的定义的合并操作的子模块。此外,我们还刻画了所谓的保模编辑集,并证明了对于每个非上图,保模编辑集的最优成对序列都存在。这最终导致了一个精确的算法的cograph编辑问题,以及固定参数易处理(FPT)的结果时,cograph编辑是参数化的所谓的模宽度。此外,我们提供了两个具有时间复杂度的算法$O(|V|^3)$,$O(|V|^2)$。

英文摘要:

The modular decomposition of a graph $G=(V,E)$ does not contain prime modules if and only if $G$ is a cograph, that is, if no quadruple of vertices induces a simple connected path $P_4$. The cograph editing problem consists in inserting into and deleting from $G$ a set $F$ of edges so that $H=(V,EΔF)$ is a cograph and $|F|$ is minimum. This NP-hard combinatorial optimization problem has recently found applications, e.g., in the context of phylogenetics. Efficient heuristics are hence of practical importance. The simple characterization of cographs in terms of their modular decomposition suggests that instead of editing $G$ one could operate directly on the modular decomposition. We show here that editing the induced $P_4$s is equivalent to resolving prime modules by means of a suitable defined merge operation on the submodules. Moreover, we characterize so-called module-preserving edit sets and demonstrate that optimal pairwise sequences of module-preserving edit sets exist for every non-cograph. This eventually leads to an exact algorithm for the cograph editing problem as well as fixed-parameter tractable (FPT) results when cograph editing is parameterized by the so-called modular-width. In addition, we provide two heuristics with time complexity $O(|V|^3)$, resp., $O(|V|^2)$.

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

↑