##
###
Deleting, Eliminating and Decomposing to Hereditary Classes Are All FPT-Equivalent
[article]

Akanksha Agrawal, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi

2022
*
arXiv
*
pre-print

For a *graph* class H, the *graph* parameters *elimination* *distance* *to* H (denoted by ed_ H) [Bulian and Dawar, Algorithmica, 2016], and H-treewidth (denoted by tw_ H) [Eiben et al. ...
by itself or any of the others *is* *FPT*-equivalent *to* the standard vertex-deletion (*to* H) problem. ...
on at most α(k) + k nodes,
23:6 *Elimination* *Distance* *to* *Topological*-*minor*-*free* *Graphs* *is* *FPT* problem definition, shortly. ...

arXiv:2104.09950v3
fatcat:2itpufur5neqzi5fhxj53dxqvy