A polynomial kernel of size O(k^33) is given for (Proper-Interval, Tree)-Vertex Deletion parameterized by solution size k.
Packing arc-disjoint cycles in oriented graphs.Journal of Computer and System Sciences, 143:103530
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees
A polynomial kernel of size O(k^33) is given for (Proper-Interval, Tree)-Vertex Deletion parameterized by solution size k.