Download or read book An Efficient Way for Edge-Connectivity Augmentation written by Toshimasa Watanabe and published by . This book was released on 1987 with total page 64 pages. Available in PDF, EPUB and Kindle. Book excerpt: The problem in which the object is to add a minimum weight set of edges to a graph G = (V, E) so as to satisfy a given vertex- or edge-connectivity condition is called the vertex- or edge- connectivity augmentation problem. The unweighted version of some edge-connectivity augmentation problem for graphs without edges is shown to be polynomially solvable. Consider the following problems: (i) The strong connectivity augmentation problem for directed graphs. (ii) The bridge-connectivity augmentation problem for undirected graphs. (iii) The biconnectivity augmentation problem for undirected graphs. An improvement is made to a previous algorithm. Keywords: Edge connectivity augmentation problem; Algorithm; Computational complexity.