Improved Kernels for Edge Modification Problems

Yixin Cao, Yuping Ke
{"title":"Improved Kernels for Edge Modification Problems","authors":"Yixin Cao, Yuping Ke","doi":"10.4230/LIPIcs.IPEC.2021.13","DOIUrl":null,"url":null,"abstract":"In an edge modification problem, we are asked to modify at most k edges of a given graph to make the graph satisfy a certain property. Depending on the operations allowed, we have the completion problems and the edge deletion problems. A great amount of efforts have been devoted to understanding the kernelization complexity of these problems. We revisit several well-studied edge modification problems, and develop improved kernels for them: a 2 k -vertex kernel for the cluster edge deletion problem, a 3 k 2 -vertex kernel for the trivially perfect completion problem, a 5 k 1.5 -vertex kernel for the split completion problem and the split edge deletion problem, and a 5 k 1.5 -vertex kernel for the pseudo-split completion problem and the pseudo-split edge deletion problem. Moreover, our kernels for split completion and pseudo-split completion have only O ( k 2.5 ) edges. Our results also include a 2 k -vertex kernel for the strong triadic closure problem, which is related to cluster edge deletion.","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Parameterized and Exact Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/LIPIcs.IPEC.2021.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In an edge modification problem, we are asked to modify at most k edges of a given graph to make the graph satisfy a certain property. Depending on the operations allowed, we have the completion problems and the edge deletion problems. A great amount of efforts have been devoted to understanding the kernelization complexity of these problems. We revisit several well-studied edge modification problems, and develop improved kernels for them: a 2 k -vertex kernel for the cluster edge deletion problem, a 3 k 2 -vertex kernel for the trivially perfect completion problem, a 5 k 1.5 -vertex kernel for the split completion problem and the split edge deletion problem, and a 5 k 1.5 -vertex kernel for the pseudo-split completion problem and the pseudo-split edge deletion problem. Moreover, our kernels for split completion and pseudo-split completion have only O ( k 2.5 ) edges. Our results also include a 2 k -vertex kernel for the strong triadic closure problem, which is related to cluster edge deletion.
边缘修正问题的改进核
在边修改问题中,我们被要求修改给定图的最多k条边,以使图满足一定的性质。根据允许的操作,我们有补全问题和边删除问题。大量的努力已经投入到理解这些问题的核化复杂性。我们回顾了几个研究得很好的边修改问题,并为它们开发了改进的核:用于聚类边删除问题的2k顶点核,用于普通完美补全问题的3k顶点核,用于分裂补全问题和分裂边删除问题的5k 1.5顶点核,以及用于伪分裂补全问题和伪分裂边删除问题的5k 1.5顶点核。此外,我们的分割补全和伪分割补全的核只有O (k 2.5)条边。我们的结果还包括一个2 k顶点核,用于强三元闭包问题,这与聚类边缘删除有关。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信