A parameter for vulnerability evaluation of packet switched communication networks

The author provides certain properties of the minimum density of a cut set and finds its relation to the connectivity vector. He also provides an efficient algorithm which finds a tight upper bound to the minimum cut density and determines the location of a corresponding cut in the network. The proposed algorithm provides an efficient way to identify a cut set the density of which is often the minimum one or a tight upper bound to the minimum density. However, the minimum density and the sparse cut itself can always be found from a linear program