9 citations · 10 across the 3 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…
Acyclic coloring of special digraphs
Frank Gurski, Dominique Komander, Carolin Rehs
An acyclic r-coloring of a directed graph G=(V,E) is a partition of the vertex set V into r acyclic sets. The dichromatic number of a directed graph G is the smallest r such that G…
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…