Dominated Cluster Deletion and elimination distance to dominated clusters are uniformly fixed-parameter tractable in f(k,d)·n^{O(d)} and, on graphs of semi-ladder index ℓ, in f(k,d,ℓ)·n^{O(1)}.
Bodlaender, \' E douard Bonnet, Lars Jaffke, Dusan Knop, Paloma T
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Elimination Distance to Dominated Clusters
Dominated Cluster Deletion and elimination distance to dominated clusters are uniformly fixed-parameter tractable in f(k,d)·n^{O(d)} and, on graphs of semi-ladder index ℓ, in f(k,d,ℓ)·n^{O(1)}.