Length 3 Edge-Disjoint Paths Is NP-Hard

Hannah Alpert, Jennifer Iglesias. Length 3 Edge-Disjoint Paths Is NP-Hard. Computational Complexity, 21(3):511-513, 2012. [doi]

Abstract

Abstract is missing.