Minimal Edge-Coverings of Pairs of Sets
FrankA., JordanT. · Journal of Combinatorial Theory Series B · 1995
We derive a new min-max formula for the minimum number of new edges to be added to a given directed graph to make it k-node-connected. This gives rise to a polynomial time algorithm (via the ellips...