An algorithm to increase the node-connectivity of a digraph by one

We develop a combinatorial polynomial-time algorithm to make a (k−1)(k−1)-connected digraph kk-connected by adding a minimum number of new edges.