Pathwidth-eta Deletion admits a uniform polynomial kernel of size O(|M|^3) when a vertex cover M is given, unlike Treewidth-eta Deletion.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Where Treewidth and Pathwidth Diverge: Towards a Uniform Kernel for Pathwidth-$\eta$ Deletion
Pathwidth-eta Deletion admits a uniform polynomial kernel of size O(|M|^3) when a vertex cover M is given, unlike Treewidth-eta Deletion.