𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Connectivity augmentation of networks: structures and algorithms

✍ Scribed by András Frank

Book ID
106276065
Publisher
Springer-Verlag
Year
1999
Tongue
English
Weight
22 KB
Volume
84
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast Algorithms for k-Shredders and k-No
Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
✍ Joseph Cheriyan; Ramakrishna Thurimella 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 321 KB

A k-separator k-shredder of a k-node connected undirected graph is a set of k Ž . nodes whose removal results in two or more three or more connected components. Let n denote the number of nodes. Solving an open question, we show that the problem of counting the number of k-separators is ࠻P-complete.

Distributed algorithms for connectivity
Distributed algorithms for connectivity problem of networks with faulty elements
✍ Koichi Wada; Yukio Moritani; Kimio Kawaguchi; Masahiro Morishita 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 919 KB

## Abstract Distributed algorithms for computing the connectivity of an asynchronous computer network with faulty computers and links are investigated. Computers which are adjacent to faulty computers and links are assumed to be capable of detecting the faults. The existence and efficiency of distr

NOTE Improved Approximation Algorithms f
NOTE Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems
✍ Michal Penn; Haya Shasha-Krupnik 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 126 KB

The problem of finding a minimum augmenting edge-set to make a graph k-vertex connected is considered. This problem is denoted as the minimum k-augmentation problem. For weighted graphs, the minimum k-augmentation problem is NP-complete. Our main result is an approximation algorithm with a performan