An O(4^{k + k log k} n + n m^2)-time algorithm for TREE CONTAINMENT parameterized by scanwidth k of a given tree-extension, with a matching ETH lower bound of no 2^{o(c log c)} n^{O(1)} algorithm for directed cutwidth c even on binary inputs.
Solving the Tree Containment Problem for Reticulation-Visible Networks in Linear Time
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
-
Tree Containment Parameterized by Scanwidth
An O(4^{k + k log k} n + n m^2)-time algorithm for TREE CONTAINMENT parameterized by scanwidth k of a given tree-extension, with a matching ETH lower bound of no 2^{o(c log c)} n^{O(1)} algorithm for directed cutwidth c even on binary inputs.