A Note on Eswaran and Tarjan's Algorithm for the Strong Connectivity Augmentation Problem
نویسنده
چکیده
In a seminal paper Eswaran and Tarjan [1] introduced several augmentation problems and presented linear time algorithms for them. This paper points out an error in Eswaran and Tarjan's algorithm for the strong connectivity augmentation problem. Consequently, the application of their algorithm can result in a network that is not strongly connected. Luckily, the error can be fixed fairly easily, and this note points out the remedy yielding a "corrected" linear time algorithm for the strong connectivity augmentation problem.
منابع مشابه
A 1-(S, T)-edge-connectivity augmentation algorithm
We present a combinatorial algorithm for the 1-(S; T)-edge-connectivity augmentation problem in digraphs. The general k-(S; T)-edge-connectivity augmentation problem was rst solved by A. Frank and T. Jordd an, Minimal Edge-coverings by Pairs of Sets, Journal of Combinatorial Theory Ser. B, submitted, but their proof does not yield a polynomial-time algorithm. Our algorithm generalizes an earlie...
متن کاملEdge-Connectivity Augmentation Problems
The problem in which the object is to add a minimum weight set of edges to a graph so as to satisfy a given condition is called the augmentation problem. This problem has a wide variety [3-5, 10, 11, 14-201. If such a given condition is concerned with the vertexor edge-connectivity of a graph then the problem is referred to as the (vertexor edge-) connectivity augmentation problem. Frank and Ch...
متن کاملA note on polyomino chains with extremum general sum-connectivity index
The general sum-connectivity index of a graph $G$ is defined as $chi_{alpha}(G)= sum_{uvin E(G)} (d_u + d_{v})^{alpha}$ where $d_{u}$ is degree of the vertex $uin V(G)$, $alpha$ is a real number different from $0$ and $uv$ is the edge connecting the vertices $u,v$. In this note, the problem of characterizing the graphs having extremum $chi_{alpha}$ values from a certain collection of polyomino ...
متن کاملA note on connectivity and lambda-modified Wiener index
In theoretical chemistry, -modified Wiener index is a graph invariant topological index to analyze the chemical properties of molecular structure. In this note, we determine the minimum -modified Wiener index of graph with fixed connectivity or edge-connectivity. Our results also present the sufficient and necessary condition for reaching the lower bound.
متن کاملAugmenting Graphs to Meet Edge-Connectivity Requirements
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)? Generali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017