A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs

2020
*
International Symposium on Mathematical Foundations of Computer Science
*

For a fixed graph H, the H-IS-Deletion problem asks, given a graph G, for the minimum size of a set S ⊆ V(G) such that G⧵ S does not contain H as an induced subgraph. Motivated by previous work about hitting (topological) minors and subgraphs on bounded treewidth graphs, we are interested in determining, for a fixed graph H, the smallest function f_H(t) such that H-IS-Deletion can be solved in time f_H(t) ⋅ n^{𝒪(1)} assuming the Exponential Time Hypothesis (ETH), where t and n denote the

doi:10.4230/lipics.mfcs.2020.82
dblp:conf/mfcs/SauS20
fatcat:lwuti2cppjdcxjhefajpssufye