Length 3 Edge-Disjoint Paths Is NP-Hard
Name
37_2012_Article_38.pdf
Size
147.63 KB
Format
Adobe PDF
Checksum (MD5)
ae60dbc88ae8c4746e4fc53a12322859
Author(s)
Alpert, Hannah
Iglesias, Jennifer
Date Issued
March 2012
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
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.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
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.
Persistent DSpace Link
DOI of Published Version
http://dx.doi.org/10.1007/s00037-012-0038-4
