M. Bentert

activity

20172025

k

-independent graphs and

c

-colorable subgraphs in scheduling: A review

18 citations · 23 across the 12 of their papers we have counts for

collaborators

Showing math.COShow all

1 paper · 1 filter

math.CO2020★ 2 cited

Using a geometric lens to find k disjoint shortest paths

Matthias Bentert, André Nichterlein, Malte Renken +1

Given an undirected $n$ -vertex graph and $k$ pairs of terminal vertices $(s_{1}, t_{1}), \dots, (s_{k}, t_{k})$ , the $k$ -Disjoint Shortest Paths ( $k$ -DSP)-problem asks whether there are $k$ …