In the Cograph Deletion (resp., Cograph Editing) problem the input is a graph G and an integer k, and the goal is to decide whether there is a set of edges of size at most k whose removal from G (resp., removal and addition to G) results in a graph that does not contain an induced path with four vertices. In this paper we give algorithms for Cograph Deletion and Cograph Editing whose running times are $O^{⁎}({2.303}^k)$ and $O^{⁎}({4.329}^k)$, respectively.

中文翻译：

---

解决cograph边缘修改问题的更快算法

在Cograph删除（resgraph。，Cograph Editing）问题中，输入是图形G和一个整数k，目标是确定是否存在一组大小最大为k的边，其从G中去除（resp。，remove）。以及除G之外的结果将导致图形不包含具有四个顶点的诱导路径。在本文中，我们给出了Cograph删除和Cograph编辑的算法，其运行时间为${Ø}^{⁎}（{2.303}^{ķ}）$ 和 ${Ø}^{⁎}（{4.329}^{ķ}）$， 分别。