Reconstructing Metric Trees from Order Information on Triples is NP Complete
Combinatorics
2007-05-23 v1
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.
Keywords
Cite
@article{arxiv.math/0603116,
title = {Reconstructing Metric Trees from Order Information on Triples is NP Complete},
author = {Eric Babson},
journal= {arXiv preprint arXiv:math/0603116},
year = {2007}
}