J. Voborník

collaborators

2 papers

cs.DS2019

On Polynomial-Time Combinatorial Algorithms for Maximum $L$ -Bounded Flow

Kateřina Altmanová, Petr Kolman, Jan Voborník

Given a graph $G = (V, E)$ with two distinguished vertices $s, t \in V$ and an integer $L$ , an {\em $L$ -bounded flow} is a flow between $s$ and $t$ that can be decomposed into paths of…

cs.DM2016

On $H$ -Topological Intersection Graphs

Steven Chaplick, Martin Töpfer, Jan Voborník +1

Biró et al. (1992) introduced $H$ -graphs, intersection graphs of connected subgraphs of a subdivision of a graph $H$ . They are related to many classes of geometric intersection gra…

On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow

On H-Topological Intersection Graphs

On Polynomial-Time Combinatorial Algorithms for Maximum $L$ -Bounded Flow

On $H$ -Topological Intersection Graphs