O(k^5)-vertex kernel for Deletion to Scattered Cliques and Trees, the first non-trivial polynomial kernel for any deletion-to-scattered-classes problem.
Expansion lemma - variations and applications to polynomial-time preprocessing.Algorithms, 16(3):144
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
O(k^5)-vertex kernel for Deletion to Scattered Cliques and Trees, the first non-trivial polynomial kernel for any deletion-to-scattered-classes problem.