Reconstructing Metric Trees from Order Information on Triples is NP Complete

Details Reconstructing Metric Trees from Order Information on Triples is NP Complete Reconstructing Metric Trees from Order Information on Triples is NP Complete

2006-03-04

arxiv.org/abs/math/0603116v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Reconstructing Metric Trees from Order Information on Triples is NP Complete does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reconstructing Metric Trees from Order Information on Triples is NP Complete, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reconstructing Metric Trees from Order Information on Triples is NP Complete will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-291971