An algorithm to increase the node-connectivity of a digraph by one
Frank, A. & Végh, L. A.
(2008).
An algorithm to increase the node-connectivity of a digraph by one.
Discrete Optimization,
5(4), 677-684.
https://doi.org/10.1016/j.disopt.2008.03.002
(2008).
An algorithm to increase the node-connectivity of a digraph by one.
Discrete Optimization,
5(4), 677-684.
https://doi.org/10.1016/j.disopt.2008.03.002
We develop a combinatorial polynomial-time algorithm to make a (k−1)-connected digraph k-connected by adding a minimum number of new edges.