1 citations · 1 across the 9 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DM2023
Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model
Matthias Bentert, Jannik Schestag, Frank Sommer
We study a generalization of the classic Spanning Tree problem that allows for a non-uniform failure model. More precisely, edges are either \emph{safe} or \emph{unsafe} and we ass…
cs.DS2023
Two-sets cut-uncut on planar graphs
Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin +2
We study the following Two-Sets Cut-Uncut problem on planar graphs. Therein, one is given an undirected planar graph and two sets of vertices and . The question is, what…