| 标题 |
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary |
| 网址 | |
| DOI | |
| 其它 |
期刊:ACM-SIAM Symposium on Discrete Algorithms 作者:Julien Baste; Ignasi Sau; D. Thilikos 出版日期:2019-07-09 |
| 求助人 | |
| 下载 |
PDF的下载单位、IP信息已删除
(2025-6-4)