Andrds Frank Research Institute for Discrete Mathematics, Institute for Operations Research, University of Bonn, West Germany and Department of Computer Science, Eiitviis University, Hungary. What is the minimum number 7 of edges to be added to a given graph G so that in the resulting graph the edge-connectivity between every pair {U, U} of nodes is at least a prescribed value T(U, v)? Generalizing earlier results of S. Sridhar and R. Chandrasekaran (when G is the empty graph), of K.P. Eswaran… CONTINUE READING