共图编辑问题的解决技巧:模块合并等价于编辑P4s
Techniques for the Cograph Editing Problem: Module Merge is equivalent to Editing P4s
摘要:
余图是没有四个顶点导出简单连通路$P_4$的图。上图编辑是针对给定的图$G = (V,E)$,找到将$G$转换为上图的至多$k$边添加和删除的集合。这个组合优化问题是NP难的。它最近在遗传学的背景下发现了应用,因此良好的遗传学具有实际重要性。众所周知,上图编辑问题可以在$G$的模分解的所谓强素模上独立解决。在这里,我们表明,编辑诱导$P_4$的一个给定的图是等价于解决强素模块的一个新定义的合并操作的子模块。这一观察结果导致了一个新的精确算法的cograph编辑问题,可以作为一个起点,为建设新的算法。
英文摘要:
Cographs are graphs in which no four vertices induce a simple connected path $P_4$. Cograph editing is to find for a given graph $G = (V,E)$ a set of at most $k$ edge additions and deletions that transform $G$ into a cograph. This combinatorial optimization problem is NP-hard. It has, recently found applications in the context of phylogenetics, hence good heuristics are of practical importance. It is well-known that the cograph editing problem can be solved independently on the so-called strong prime modules of the modular decomposition of $G$. We show here that editing the induced $P_4$'s of a given graph is equivalent to resolving strong prime modules by means of a newly defined merge operation on the submodules. This observation leads to a new exact algorithm for the cograph editing problem that can be used as a starting point for the construction of novel heuristics.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。