𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel and fast sequential algorithms for undirected edge connectivity augmentation

✍ Scribed by András A. Benczúr

Publisher
Springer-Verlag
Year
1999
Tongue
English
Weight
320 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.