Search Results

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 integer k, adds (randomly) to G a number of arcs such that for every minimal st-...

We present an undirected version of the recently introduced flow-augmentation technique: Given an undirected multigraph G with distinguished vertices s,t ∈ V(G) and an integer k, one can in randomized k^𝒪(1) ⋅ (|V(G)| + |E(G)|) time sample a set A ⊆ \(\(\...\)

We show a flow-augmentation algorithm in directed graphs: There exists a randomized polynomial-time algorithm that, given a directed graph G, two integers s,t ∈ V(G), and an integer k, adds (randomly) to G a number of arcs such that for every minimal st-...