✦ LIBER ✦

Successive edge-connectivity augmentation problems

✍ Scribed by Eddie Cheng; Tibor Jordán

Publisher: Springer-Verlag
Year: 1999
Tongue: English
Weight: 119 KB
Volume: 84
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s101070050041

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum Augmentation of Edge-Connectivit

Minimum Augmentation of Edge-Connectivity between

✍ Toshimasa Ishii; Yoko Akiyama; Hiroshi Nagamochi 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 692 KB

Approximating Rooted Connectivity Augmen

Approximating Rooted Connectivity Augmentation Problems

✍ Zeev Nutov 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 246 KB

Approximating Node-Connectivity Augmenta

Approximating Node-Connectivity Augmentation Problems

✍ Zeev Nutov 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 498 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 balanced edge connectivity and applic

On balanced edge connectivity and applications to some bottleneck augmentation problems in networks

✍ Michael Bussieck 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 439 KB