Length 3 Edge-Disjoint Paths and Partial Orientation

Details Length 3 Edge-Disjoint Paths and Partial Orientation Length 3 Edge-Disjoint Paths and Partial Orientation

2012-01-31

arxiv.org/abs/1201.6578v1

Computer Science

Computational Complexity

5 pages, 2 figures

Scientific paper

In 2003, it was claimed that the following problem was solvable in polynomial
time: do there exist k edge-disjoint paths of length exactly 3 between vertices
s and t in a given graph? The proof was flawed, and we show that this problem
is NP-hard even if we disallow multiple edges. We use a reduction from Partial
Orientation, a problem recently shown by P\'alv\"olgyi to be NP-hard.

Affiliated with

Also associated with

No associations

Rating

Length 3 Edge-Disjoint Paths and Partial Orientation 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 Length 3 Edge-Disjoint Paths and Partial Orientation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Length 3 Edge-Disjoint Paths and Partial Orientation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-57260