Partitionability to two trees is NP-complete

Details Partitionability to two trees is NP-complete Partitionability to two trees is NP-complete

2010-02-20

arxiv.org/abs/1002.3937v1

Computer Science

Computational Complexity

Scientific paper

We show that P2T - the problem of deciding whether the edge set of a simple
graph can be partitioned into two trees or not - is NP-complete.

Affiliated with

Also associated with

No associations

Rating

Partitionability to two trees 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 Partitionability to two trees is NP-complete, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Partitionability to two trees is NP-complete will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-608075