Showing cs.CCShow all
2 papers · 1 filter
cs.CC2025
Maximum Reachability Orientation of Mixed Graphs
Florian Hörsch
We aim to find orientations of mixed graphs optimizing the total reachability, a problem that has applications in causality and biology. For given a digraph , we use for…
cs.CC2025
Multicut Problems in Almost-Planar Graphs: The Dependency of Complexity on the Demand Pattern
Florian Hörsch, Dániel Marx
Given a graph , a set of terminal vertices, and a demand graph on , the \textsc{Multicut} problem asks for a set of edges of minimum weight that separates the pairs o…