Abstract
We consider the Directed Steiner Path Cover problem on directed co-graphs. Given a directed graph and a set of so-called terminal vertices, the problem is to find a minimum number of directed vertex-disjoint paths, which contain all terminal vertices and a minimum number of non-terminal vertices (Steiner vertices). The primary minimization criteria is the number of paths. We show how to compute a minimum Steiner path cover for directed co-graphs in linear time. For, the algorithm computes a directed Hamiltonian path if such a path exists.
Author supplied keywords
Cite
CITATION STYLE
Gurski, F., Hoffmann, S., Komander, D., Rehs, C., Rethmann, J., & Wanke, E. (2020). Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12011 LNCS, pp. 556–565). Springer. https://doi.org/10.1007/978-3-030-38919-2_45
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
