"On the complexity of finding internally vertex-disjoint long directed paths."

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

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2022-11-02

a service of  Schloss Dagstuhl - Leibniz Center for Informatics