A polynomial-time algorithm reconstructs stack-free arboreal networks from complete triplet and duet systems via a novel encoding.
SIAM J Disc Math , volume =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient Reconstruction of Arboreal Networks
A polynomial-time algorithm reconstructs stack-free arboreal networks from complete triplet and duet systems via a novel encoding.