Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds
From MaRDI portal
Publication:5130572
DOI10.1137/19M1287146zbMath1450.05084arXiv1704.07284MaRDI QIDQ5130572
Ignasi Sau, Dimitrios M. Thilikos, Julien Baste
Publication date: 28 October 2020
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.07284
dynamic programming; treewidth; parameterized complexity; graph minors; exponential time hypothesis; topological minors; hitting minors
68Q25: Analysis of algorithms and problem complexity
90C39: Dynamic programming
05C83: Graph minors
05C85: Graph algorithms (graph-theoretic aspects)