✦ LIBER ✦

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

✍ Scribed by Steffen Enni

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A computational investigation of heurist

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

✍ Jørgen Bang-Jensen; Marco Chiarandini; Peter Morling 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 845 KB

Parallel and fast sequential algorithms

Parallel and fast sequential algorithms for undirected edge connectivity augmentation

✍ András A. Benczúr 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 320 KB

Augmenting a (k - 1)-Vertex-Connected Mu

Augmenting a (k - 1)-Vertex-Connected Multigraph ℓ-Edge-Connected and k-Vertex-Connected Multigraph

✍ Toshimasa Ishii; Hiroshi Nagamochi; Toshihide Ibaraki 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 320 KB

A Simple 3-Edge-Connected Component Algo

A Simple 3-Edge-Connected Component Algorithm

✍ Yung H. Tsin 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 407 KB

Pushdown–reduce: an algorithm for connec

Pushdown–reduce: an algorithm for connectivity augmentation and poset covering problems

✍ András A. Benczúr 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 557 KB

In their seminal paper, Frank and JordÃ an show that a large class of optimization problems including certain directed edge augmentation ones fall into the class of covering supermodular functions over pairs of sets. They also give an algorithm for such problems, however, that relies on the ellipsoi

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