Computing Directed Steiner Path Covers for Directed Co-graphs (Extended Abstract)

  • Frank GurskiEmail author
  • Stefan Hoffmann
  • Dominique Komander
  • Carolin Rehs
  • Jochen Rethmann
  • Egon Wanke
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 12011)


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.


Directed co-graphs Directed Steiner path cover problem 


  1. 1.
    Abu-Affash, A.K., Carmi, P., Katz, M.J., Segal, M.: The euclidean bottleneck steiner path problem and other applications of (\(\alpha \),\(\beta \))-pair decomposition. Discret. Comput. Geom. 51(1), 1–23 (2014)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Bang-Jensen, J., Maddaloni, A.: Arc-disjoint paths in decomposable digraphs. J. Graph Theory 77, 89–110 (2014)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Bechet, D., de Groote, P., Retoré, C.: A complete axiomatisation for the inclusion of series-parallel partial orders. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, pp. 230–240. Springer, Heidelberg (1997). Scholar
  4. 4.
    Borndörfer, R., Karbstein, M., Pfetsch, M.: The steiner connectivity problem. Math. Program. 142(1), 133–167 (2013)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Corneil, D., Lerchs, H., Stewart-Burlingham, L.: Complement reducible graphs. Discrete Appl. Math. 3, 163–174 (1981)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Crespelle, C., Paul, C.: Fully dynamic recognition algorithm and certificate for directed cographs. Discrete Appl. Math. 154(12), 1722–1741 (2006)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Gurski, F., Komander, D., Rehs, C.: Computing digraph width measures on directed co-graphs. In: Gąsieniec, L.A., Jansson, J., Levcopoulos, C. (eds.) FCT 2019. LNCS, vol. 11651, pp. 292–305. Springer, Cham (2019). Scholar
  8. 8.
    Gurski, F., Rehs, C.: Directed path-width and directed tree-width of directed co-graphs. In: Wang, L., Zhu, D. (eds.) COCOON 2018. LNCS, vol. 10976, pp. 255–267. Springer, Cham (2018). Scholar
  9. 9.
    Gurski, F., Wanke, E., Yilmaz, E.: Directed NLC-width. Theor. Comput. Sci. 616, 1–17 (2016)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Lin, R., Olariu, S., Pruesse, G.: An optimal path cover algorithm for cographs. Comput. Math. Appl. 30, 75–83 (1995)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Moharana, S.S., Joshi, A., Vijay, S.: Steiner path for trees. Int. J. Comput. Appl. 76(5), 11–14 (2013)Google Scholar
  12. 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). Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Frank Gurski
    • 1
    Email author
  • Stefan Hoffmann
    • 1
  • Dominique Komander
    • 1
  • Carolin Rehs
    • 1
  • Jochen Rethmann
    • 2
  • Egon Wanke
    • 1
  1. 1.Institute of Computer ScienceHeinrich Heine UniversityDüsseldorfGermany
  2. 2.Faculty of Electrical Engineering and Computer ScienceNiederrhein University of Applied SciencesKrefeldGermany

Personalised recommendations