𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation

✍ Scribed by Jørgen Bang-Jensen; Marco Chiarandini; Peter Morling

Publisher
John Wiley and Sons
Year
2010
Tongue
English
Weight
845 KB
Volume
55
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Static 2-Approximation Algorithm for V
A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity
✍ Monika Rauch Henzinger 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 329 KB

This paper presents insertions-only algorithms for maintaining the exact andror approximate size of the minimum edge cut and the minimum vertex cut of a graph. Ž . The algorithms output the approximate or exact size k in time O 1 and a cut of size k in time linear in its size. For the minimum edge

An algorithm for construction of a k-con
An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter
✍ Ulrich Schumacher 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 470 KB

Two fundamental considerations in the design of a communication network are reliability and maximum transmission delay. In this paper we give an algorithm for construction of an undirected graph with n vertices in which there are k node-disjoint paths between any two nodes. The generated graphs will