Proves that arc-deletion distance to orchard networks is NP-hard via polynomial reduction from Degree-3 Vertex Cover.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Spinal tree-child networks are enumerated via restricted words with fixed multiplicities modulo relabeling for closed formulas and via bivariate generating functions from recursive marked-tree specifications.
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.
-
Counting Spinal Tree-Child Networks via Word Encodings and Generating Functions
Spinal tree-child networks are enumerated via restricted words with fixed multiplicities modulo relabeling for closed formulas and via bivariate generating functions from recursive marked-tree specifications.