Length 3 Edge-Disjoint Paths Is NP-Hard

Author(s)
Alpert, Hannah; Iglesias, Jennifer
Thumbnail
Download37_2012_Article_38.pdf (147.6Kb)
PUBLISHER_POLICY
Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
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 in this note we show that this problem is NP-hard. We use a reduction from Partial Orientation, a problem recently shown by Pálvölgyi to be NP-hard.
Date issued
2012-03
URI
http://hdl.handle.net/1721.1/106920
Department
Massachusetts Institute of Technology. Department of Mathematics
Journal
computational complexity
Publisher
SP Birkhäuser Verlag Basel
Citation
Alpert, Hannah, and Jennifer Iglesias. “Length 3 Edge-Disjoint Paths Is NP-Hard.” Comput. Complex. 21, no. 3 (March 21, 2012): 511–513.
Version: Author's final manuscript
ISSN
1016-3328
1420-8954
Collections