Maximum APD subset selection is polynomial-time for scanwidth at most 2, NP-hard for scanwidth 3, with an O(2^sw n) FPT algorithm and linear-time results when the induced network is reticulation-visible or has bounded invisible reticulations per biconnected component.
15 Jannik Schestag and Norbert Zeh
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
-
Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility
Maximum APD subset selection is polynomial-time for scanwidth at most 2, NP-hard for scanwidth 3, with an O(2^sw n) FPT algorithm and linear-time results when the induced network is reticulation-visible or has bounded invisible reticulations per biconnected component.