Proves that arc-deletion distance to orchard networks is NP-hard via polynomial reduction from Degree-3 Vertex Cover.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
q-bio.PE 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Computing the Arc-Deletion Distance to Orchard Networks is NP-hard
Proves that arc-deletion distance to orchard networks is NP-hard via polynomial reduction from Degree-3 Vertex Cover.