8 citations · 9 across the 3 of their papers we have counts for
1 paper · 2 filters
Petr Kolman
Given a graph G=(V,E) with two distinguished vertices s,t∈V and an integer parameter L>0, an {\em L-bounded cut} is a subset F of edges (vertices) such that the every…