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.
Graph Theory, 4th Edition, volume 173 of Graduate texts in mathematics
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2verdicts
UNVERDICTED 2representative citing papers
An O(n log n) algorithm computes linear MIM-width of trees and produces an optimal layout.
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.
-
Linear MIM-Width of Trees
An O(n log n) algorithm computes linear MIM-width of trees and produces an optimal layout.