✦ LIBER ✦

Minimum Augmentation of Edge-Connectivity between

✍ Scribed by Toshimasa Ishii; Yoko Akiyama; Hiroshi Nagamochi

Publisher: Springer
Year: 2008
Tongue: English
Weight: 692 KB
Volume: 56
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-008-9178-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Successive edge-connectivity augmentatio

Successive edge-connectivity augmentation problems

✍ Eddie Cheng; Tibor Jordán 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 119 KB

Minimum augmentation of a tree to a K-ed

Minimum augmentation of a tree to a K-edge-connected graph

✍ Shuichi Ueno; Yoji Kajitani; Hajime Wada 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB

The minimum augmentation of any graph to

The minimum augmentation of any graph to a K-edge-connected graph

✍ Guo-Ray Cai; Yu-Geng Sun 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 883 KB

Edge splitting and connectivity augmenta

Edge splitting and connectivity augmentation in directed hypergraphs

✍ Alex R. Berg; Bill Jackson; Tibor Jordán 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 262 KB

We prove theorems on edge splittings and edge-connectivity augmentation in directed hypergraphs, extending earlier results of Mader and Frank, respectively, on directed graphs.

A 1-(S,T)-edge-connectivity augmentation

A 1-(S,T)-edge-connectivity augmentation algorithm

✍ Steffen Enni 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 66 KB

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