2 papers
math.CO2025
On the connected blocks polytope
Justus Bruckamp, Markus Chimani, Martina Juhnke
In this paper, we study the connected blocks polytope, which, apart from its own merits, can be seen as the generalization of certain connectivity based or Eulerian subgraph polyto…
cs.DS2025
Directed Capacity-Preserving Subgraphs: Hardness and Exact Polynomial Algorithms
Markus Chimani, Max Ilsen
We introduce and discuss the Minimum Capacity-Preserving Subgraph (MCPS) problem: given a directed graph and a retention ratio , find the smallest subgraph that, for e…