Length 3 Edge-Disjoint Paths Is NP-Hard
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 Orienta...
Main Authors: | Alpert, Hannah, Iglesias, Jennifer |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics |
Format: | Article |
Language: | English |
Published: |
SP Birkhäuser Verlag Basel
2017
|
Online Access: | http://hdl.handle.net/1721.1/106920 https://orcid.org/0000-0001-5813-5029 |
Similar Items
-
Approximation algorithms for disjoint paths problems
by: Kleinberg, Jon M
Published: (2005) -
Rigid foldability is NP-hard
by: Demaine, Erik D, et al.
Published: (2020) -
GPSG-Recognition is NP-Hard
by: Ristad, Eric Sven
Published: (2004) -
Edge disjoint spanning trees and failure recovery in data communication networks
by: Roskind, James Anthony
Published: (2005) -
Disjoint path protection in multi-hop wireless networks with interference constraints
by: Kuperman, Gregory, et al.
Published: (2021)