Length 3 Edge-Disjoint Paths and Partial Orientation
Computational Complexity
2012-02-01 v1 Combinatorics
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 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.
Keywords
Cite
@article{arxiv.1201.6578,
title = {Length 3 Edge-Disjoint Paths and Partial Orientation},
author = {Hannah Alpert and Jennifer Iglesias},
journal= {arXiv preprint arXiv:1201.6578},
year = {2012}
}
Comments
5 pages, 2 figures