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

Júlio Araújo et al. (2018)

Details and statistics

DOI: 10.1007/978-3-319-77404-6_6

access: closed

type: Conference or Workshop Paper

metadata version: 2022-11-02

a service of  Schloss Dagstuhl - Leibniz Center for Informatics