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

DOI10.1007/978-3-319-77404-6_6MaRDI QIDQ6830376zbMATH OpenFDO

Authors Júlio Araújo, Victor Campos, Ana Karolinna Maia, Ignasi Sau, Ana Silva

Publication date 12 February 2020

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-77404-6_6

zbMATH Keywords

complexity dichotomydigraph subdivisionFPT algorithmparameterized complexityrepresentative familyspindle

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Graph theory (including graph drawing) in computer science (68R10)

This page was built for publication: On the complexity of finding internally vertex-disjoint long directed paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6830376)