𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Connectivity Augmentation of Graphs

✍ Scribed by Bill Jackson; Tibor Jordánn

Book ID
108498126
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
230 KB
Volume
5
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extremal graphs in connectivity augmenta
Extremal graphs in connectivity augmentation
✍ Jord�n, Tibor 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB 👁 1 views

Let A(n, k, t) denote the smallest integer e for which every kconnected graph on n vertices can be made (k + t)-connected by adding e new edges. We determine A(n, k, t) for all values of n, k, and t in the case of (directed and undirected) edge-connectivity and also for directed vertex-connectivity

On the minimum local-vertex-connectivity
On the minimum local-vertex-connectivity augmentation in graphs
✍ Hiroshi Nagamochi; Toshimasa Ishii 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 179 KB

Given a graph G and target values r(u; v) prescribed for each pair of vertices u and v, we consider the problem of augmenting G by a smallest set F of new edges such that the resulting graph G+F has at least r(u; v) internally disjoint paths between each pair of vertices u and v. We show that the pr

Two-Connected Augmentation Problems in P
Two-Connected Augmentation Problems in Planar Graphs
✍ J.Scott Provan; Roger C Burk 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 167 KB

Given a weighted undirected graph G and a subgraph S of G, we consider the problem of adding a minimum-weight set of edges of G to S so that the resulting Ž . subgraph satisfies specified edge or vertex connectivity requirements between pairs of nodes of S. This has important applications in upgradi