114 citations · 306 across the 50 of their papers we have counts for
1 paper · 2 filters
Eun Jung Kim, Stefan Kratsch, Marcin Pilipczuk +1
We show a flow-augmentation algorithm in directed graphs: There exists a randomized polynomial-time algorithm that, given a directed graph G, two vertices s,t∈V(G), and an…