2 papers
cs.DM2020
Computing Directed Steiner Path Covers
Frank Gurski, Dominique Komander, Carolin Rehs +2
In this article we consider the Directed Steiner Path Cover problem on directed co-graphs. Given a directed graph G=(V,E) and a subset T of V of so-called terminal vertices, the pr…
cs.DS2018
Characterizations and Directed Path-Width of Sequence Digraphs
Frank Gurski, Carolin Rehs, Jochen Rethmann
Computing the directed path-width of a directed graph is an NP-hard problem. Even for digraphs of maximum semi-degree 3 the problem remains hard. We propose a decomposition of an i…