✦ LIBER ✦

Directed vertex-connectivity augmentation

✍ Scribed by András Frank; Tibor Jordán

Book ID: 106276072
Publisher: Springer-Verlag
Year: 1999
Tongue: English
Weight: 133 KB
Volume: 84
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s101070050038

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Optimal Vertex-Connectivity Augme

On the Optimal Vertex-Connectivity Augmentation

✍ T. Jordan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 568 KB

Independence free graphs and vertex conn

Independence free graphs and vertex connectivity augmentation

✍ Bill Jackson; Tibor Jordán 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 568 KB

A Note on the Vertex-Connectivity Augmen

A Note on the Vertex-Connectivity Augmentation Problem

✍ Tibor Jordán 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 297 KB

Augmenting Edge-Connectivity between Ver

Augmenting Edge-Connectivity between Vertex Subsets

✍ Toshimasa Ishii, Kazuhisa Makino 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 729 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

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