Karger (STOC 1995) gave the first FPTAS for the network (un)reliability
...
We give an almost-linear time algorithm for the Steiner connectivity
aug...
We give an Õ(m)-time algorithm for the edge connectivity
augmentation pr...
We give an algorithm to find a minimum cut in an edge-weighted directed ...
We give an algorithm for augmenting the edge connectivity of an undirect...
We give an algorithm to find a mincut in an n-vertex, m-edge weighted
di...
A roundtrip spanner of a directed graph G is a subgraph of G preserving
...