A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth

Julien Baste, Ignasi Sau, D. Thilikos
{"title":"A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth","authors":"Julien Baste, Ignasi Sau, D. Thilikos","doi":"10.4230/LIPIcs.IPEC.2018.2","DOIUrl":null,"url":null,"abstract":"For a fixed graph H, we are interested in the parameterized complexity of the following problem, called {H}-M-Deletion, parameterized by the treewidth tw of the input graph: given an n-vertex graph G and an integer k, decide whether there exists S subseteq V(G) with |S| <= k such that G setminus S does not contain H as a minor. In previous work [IPEC, 2017] we proved that if H is planar and connected, then the problem cannot be solved in time 2^{o(tw)} * n^{O(1)} under the ETH, and can be solved in time 2^{O(tw * log tw)} * n^{O(1)}. In this article we manage to classify the optimal asymptotic complexity of {H}-M-Deletion when H is a connected planar graph on at most 5 vertices. Out of the 29 possibilities (discarding the trivial case H = K_1), we prove that 9 of them are solvable in time 2^{Theta (tw)} * n^{O(1)}, and that the other 20 ones are solvable in time 2^{Theta (tw * log tw)} * n^{O(1)}. Namely, we prove that K_4 and the diamond are the only graphs on at most 4 vertices for which the problem is solvable in time 2^{Theta (tw * log tw)} * n^{O(1)}, and that the chair and the banner are the only graphs on 5 vertices for which the problem is solvable in time 2^{Theta (tw)} * n^{O(1)}. For the version of the problem where H is forbidden as a topological minor, the case H = K_{1,4} can be solved in time 2^{Theta (tw)} * n^{O(1)}. This exhibits, to the best of our knowledge, the first difference between the computational complexity of both problems.","PeriodicalId":137775,"journal":{"name":"International Symposium on Parameterized and Exact Computation","volume":"133 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Parameterized and Exact Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/LIPIcs.IPEC.2018.2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

For a fixed graph H, we are interested in the parameterized complexity of the following problem, called {H}-M-Deletion, parameterized by the treewidth tw of the input graph: given an n-vertex graph G and an integer k, decide whether there exists S subseteq V(G) with |S| <= k such that G setminus S does not contain H as a minor. In previous work [IPEC, 2017] we proved that if H is planar and connected, then the problem cannot be solved in time 2^{o(tw)} * n^{O(1)} under the ETH, and can be solved in time 2^{O(tw * log tw)} * n^{O(1)}. In this article we manage to classify the optimal asymptotic complexity of {H}-M-Deletion when H is a connected planar graph on at most 5 vertices. Out of the 29 possibilities (discarding the trivial case H = K_1), we prove that 9 of them are solvable in time 2^{Theta (tw)} * n^{O(1)}, and that the other 20 ones are solvable in time 2^{Theta (tw * log tw)} * n^{O(1)}. Namely, we prove that K_4 and the diamond are the only graphs on at most 4 vertices for which the problem is solvable in time 2^{Theta (tw * log tw)} * n^{O(1)}, and that the chair and the banner are the only graphs on 5 vertices for which the problem is solvable in time 2^{Theta (tw)} * n^{O(1)}. For the version of the problem where H is forbidden as a topological minor, the case H = K_{1,4} can be solved in time 2^{Theta (tw)} * n^{O(1)}. This exhibits, to the best of our knowledge, the first difference between the computational complexity of both problems.
用Treewidth参数化的平面小分支的复杂度二分法
对于固定图H,我们感兴趣的是以下问题的参数化复杂度,称为{H}-M-Deletion,由输入图的树宽tw参数化:给定一个n顶点图G和一个整数k,判断是否存在S subseteq V(G),且|S| <= k,使得G set- S不包含H作为子集。在之前的工作[IPEC, 2017]中,我们证明了如果H是平面且连通的,那么在ETH下,问题不能在2^{o(tw)} * n^{o(1)}时间内解决,而可以在2^{o(tw * log tw)} * n^{o(1)}时间内解决。在本文中,我们设法对{H}-M-Deletion的最优渐近复杂度进行了分类,当H是一个最多有5个顶点的连通平面图时。在29种可能性中(抛弃H = K_1的平凡情况),我们证明了其中9种在2^{Theta (tw)} * n^{O(1)}时间内可解,另外20种在2^{Theta (tw * log tw)} * n^{O(1)}时间内可解。也就是说,我们证明了K_4和菱形图是在2^{Theta (tw * log tw)} * n^{O(1)}时间内问题在最多4个顶点上可解的图,而椅子和横幅是在5个顶点上问题在2^{Theta (tw)} * n^{O(1)}时间内可解的图。对于H作为拓扑次元被禁止的问题版本,H = K_{1,4}的情况可以在2^{Theta (tw)} * n^{O(1)}时间内求解。据我们所知,这显示了两个问题的计算复杂度之间的第一个区别。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信