| dc.contributor.author | Alpert, Hannah | |
| dc.contributor.author | Iglesias, Jennifer | |
| dc.date.accessioned | 2017-02-10T22:36:18Z | |
| dc.date.available | 2017-02-10T22:36:18Z | |
| dc.date.issued | 2012-03 | |
| dc.identifier.issn | 1016-3328 | |
| dc.identifier.issn | 1420-8954 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/106920 | |
| dc.description.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. | en_US |
| dc.publisher | SP Birkhäuser Verlag Basel | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1007/s00037-012-0038-4 | en_US |
| dc.rights | 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. | en_US |
| dc.source | SP Birkhäuser Verlag Basel | en_US |
| dc.title | Length 3 Edge-Disjoint Paths Is NP-Hard | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Alpert, Hannah, and Jennifer Iglesias. “Length 3 Edge-Disjoint Paths Is NP-Hard.” Comput. Complex. 21, no. 3 (March 21, 2012): 511–513. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | en_US |
| dc.contributor.mitauthor | Alpert, Hannah | |
| dc.relation.journal | computational complexity | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
| dc.date.updated | 2016-08-18T15:40:14Z | |
| dc.language.rfc3066 | en | |
| dc.rights.holder | Springer Basel AG | |
| dspace.orderedauthors | Alpert, Hannah; Iglesias, Jennifer | en_US |
| dspace.embargo.terms | N | en |
| dc.identifier.orcid | https://orcid.org/0000-0001-5813-5029 | |
| mit.license | PUBLISHER_POLICY | en_US |
