Reconstructing Metric Trees from Order Information on Triples is NP Complete
From MaRDI portal
Abstract: We show that reconstructing a tree from order information on triples is NP-hard. This is in contrast to the case for ultra-metrics and for subtree information on quadruples which are both known to allow polynomial time reconstruction.
This page was built for publication: Reconstructing Metric Trees from Order Information on Triples is NP Complete
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6476816)
