2 papers
cs.DS2021
Algorithms and Complexity for the Almost Equal Maximum Flow Problem
Rebekka Haese, Till Heller, Sven O. Krumke
In the Equal Maximum Flow Problem (EMFP), we aim for a maximum flow where we require the same flow value on all edges in some given subsets of the edge set. In this paper, we study…
math.CO2020
2.5-Connectivity: Unique Components, Critical Graphs, and Applications
Irene Heinrich, Till Heller, Eva Schmidt +1
If a biconnected graph stays connected after the removal of an arbitrary vertex and an arbitrary edge, then it is called 2.5-connected. We prove that every biconnected graph has a…