8 citations · 9 across the 3 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2019
On Polynomial-Time Combinatorial Algorithms for Maximum -Bounded Flow
Kateřina Altmanová, Petr Kolman, Jan Voborník
Given a graph with two distinguished vertices and an integer , an {\em -bounded flow} is a flow between and that can be decomposed into paths of…
cs.DS2017★ 1 cited
On Algorithms for -bounded Cut Problem
Petr Kolman
Given a graph with two distinguished vertices and an integer parameter , an {\em -bounded cut} is a subset of edges (vertices) such that the every…
cs.DS2015★ 8 cited
Extension Complexity, MSO Logic, and Treewidth
Petr Kolman, Martin Koutecký, Hans Raj Tiwary
We consider the convex hull of all satisfying assignments of a given MSO formula on a given graph . We show that there exists an extended formulation of the polytop…