Complexity of some Path Problems in DAGs and Linear Orders

Details Complexity of some Path Problems in DAGs and Linear Orders Complexity of some Path Problems in DAGs and Linear Orders

2007-10-11

arxiv.org/abs/0710.2268v1

Mathematics

Combinatorics

5 pages, 3 figures

Scientific paper

We investigate here the computational complexity of three natural problems in
directed acyclic graphs. We prove their NP Completeness and consider their
restrictions to linear orders.

Affiliated with

Also associated with

No associations

Rating

Complexity of some Path Problems in DAGs and Linear Orders 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 Complexity of some Path Problems in DAGs and Linear Orders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity of some Path Problems in DAGs and Linear Orders will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-541953