Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract)
We consider the Directed Steiner Path Cover problem on directed co-graphs. Given a directed graph \(G=(V(G),E(G))\) and a set \(T \subseteq V(G)\) 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 \(T = V(G)\), the algorithm computes a directed Hamiltonian path if such a path exists.
KeywordsDirected co-graphs Directed Steiner path cover problem
- 11.Moharana, S.S., Joshi, A., Vijay, S.: Steiner path for trees. Int. J. Comput. Appl. 76(5), 11–14 (2013)Google Scholar
- 12.Nøjgaard, N., El-Mabrouk, N., Merkle, D., Wieseke, N., Hellmuth, M.: Partial homology relations - satisfiability in terms of di-cographs. In: Wang, L., Zhu, D. (eds.) COCOON 2018. LNCS, vol. 10976, pp. 403–415. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-94776-1_34CrossRefGoogle Scholar