9 citations · 10 across the 2 of their papers we have counts for
3 papers · 1 filter
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…
Solutions for Subset Sum Problems with Special Digraph Constraints
Frank Gurski, Dominique Komander, Carolin Rehs
The subset sum problem is one of the simplest and most fundamental NP-hard problems in combinatorial optimization. We consider two extensions of this problem: The subset sum proble…
On Characterizations for Subclasses of Directed Co-Graphs
Frank Gurski, Dominique Komander, Carolin Rehs
Undirected co-graphs are those graphs which can be generated from the single vertex graph by disjoint union and join operations. Co-graphs are exactly the P_4-free graphs (where P_…