Article ID Journal Published Year Pages File Type
1141786 Discrete Optimization 2008 8 Pages PDF
Abstract

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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Control and Optimization
Preview
An algorithm to increase the node-connectivity of a digraph by one
Authors
, ,