当前位置:
X-MOL 学术
›
Inf. Process. Lett.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Faster algorithms for cograph edge modification problems
Information Processing Letters ( IF 0.7 ) Pub Date : 2020-03-23 , DOI: 10.1016/j.ipl.2020.105946 Dekel Tsur
中文翻译:
解决cograph边缘修改问题的更快算法
更新日期:2020-03-23
Information Processing Letters ( IF 0.7 ) Pub Date : 2020-03-23 , DOI: 10.1016/j.ipl.2020.105946 Dekel Tsur
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 and , respectively.
中文翻译:
解决cograph边缘修改问题的更快算法
在Cograph删除(resgraph。,Cograph Editing)问题中,输入是图形G和一个整数k,目标是确定是否存在一组大小最大为k的边,其从G中去除(resp。,remove)。以及除G之外的结果将导致图形不包含具有四个顶点的诱导路径。在本文中,我们给出了Cograph删除和Cograph编辑的算法,其运行时间为 和 , 分别。