\(k\)-vertex-connectivity minimum augmentation for undirected unweighted graphs. (Q1407835)

The authors provide an algorithm for the following problem: Given a graph \(G=(V(G),E(G))\) and a number \(k\). Find a minimum set \(E'\) of edges not in \(E(G)\) so that adding edges in \(E'\) to \(G\) results in a \(k\)-connected graph. The complexity of the algorithm is \(O(k| V(G)| ^5)\).