On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths

Júlio Araújo, Victor A. Campos, Ana Karolinna Maia, Ignasi Sau, Ana Silva. On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths. In Michael A. Bender, Martin Farach-Colton, Miguel A. Mosteiro, editors, LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings. Volume 10807 of Lecture Notes in Computer Science, pages 66-79, Springer, 2018. [doi]

Abstract

Abstract is missing.