A minimum 3-connectivity augmentation of a graph
TLDR
It is shown that the cardinality of a solution to the problem can be computed from a given graph and that there is an O ( n v + n e ) algorithm for finding a solution, where n v and n e are the numbers of vertices and edges of a givengraph, respectively.About:
This article is published in Journal of Computer and System Sciences.The article was published on 1993-02-01 and is currently open access. It has received 49 citations till now. The article focuses on the topics: Complement graph & Strength of a graph.read more
Citations
More filters
Journal ArticleDOI
Hardness of Approximation for Vertex-Connectivity Network Design Problems
TL;DR: The first strong lower bound on the approximability of SNDP is given, showing that the problem admits no efficient 2-1- n ratio approximation for any fixed $\epsilon\!
Journal ArticleDOI
An approximation algorithm for minimum-cost vertex-connectivity problems
R. Ravi,David P. Williamson +1 more
TL;DR: In this paper, a primal-dual approach was used to solve the survivable network design problem, where a minimum cost set of edges such that there are vertex-disjoint paths between verticesi andj must be found.
Journal ArticleDOI
Independence free graphs and vertex connectivity augmentation
Bill Jackson,Tibor Jordán +1 more
TL;DR: An algorithm is developed which delivers an optimal solution in polynomial time for every fixed k in the k-vertex-connectivity augmentation problem and derives a min-max formula for the size of a smallest augmenting set in this case.
Journal ArticleDOI
An overview of algorithms for network survivability
TL;DR: This paper characterize three main components in establishing network survivability for an existing network, namely, determining network connectivity, augmenting the network, and finding disjoint paths.
Journal ArticleDOI
Graph connectivity and its augmentation: applications of MA orderings
TL;DR: This paper surveys how the maximum adjacency (MA) ordering of the vertices in a graph can be used to solve various graph problems, and explains that the minimum cut problem can be solved efficiently by utilizing the MA ordering.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Book
Graph Algorithms
TL;DR: A thoroughly revised second edition of Shimon Even's Graph Algorithms, with a foreword by Richard M. Karp and notes by Andrew V Goldberg, explains algorithms in a formal but simple language with a direct and intuitive presentation.
Journal ArticleDOI
Dividing a Graph into Triconnected Components
TL;DR: An algorithm for dividing a graph into triconnected components is presented and is both theoretically optimal to within a constant factor and efficient in practice.