✦ LIBER ✦

Augmenting Edge-Connectivity between Vertex Subsets

✍ Scribed by Toshimasa Ishii, Kazuhisa Makino

Book ID: 120910044
Publisher: Springer
Year: 2012
Tongue: English
Weight: 729 KB
Volume: 69
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-012-9724-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Edge connectivity between nodes and node

Edge connectivity between nodes and node-subsets

✍ Ito, Hiro; Yokoyama, Mitsuo 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

Let G Å (V, E) be a graph where V and E are a set of nodes and a set of edges, respectively. Let X Å {V 1 , V 2 , . . . , V p }, V i ⊆ V be a family of node-subsets. Each node-subset V i is called an area, and a pair of G and X is called an area graph. A node £ √ V and an area V i √ X are called k-N

Minimum Augmentation of Edge-Connectivit

Minimum Augmentation of Edge-Connectivity between

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

Directed vertex-connectivity augmentatio

Directed vertex-connectivity augmentation

✍ András Frank; Tibor Jordán 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 133 KB

Optimal Augmentation of a 2-Vertex-Conne

Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph

✍ Toshimasa Ishii; Hiroshi Nagamochi; Toshihide Ibaraki 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 584 KB

Augmenting Undirected Edge Connectivity

Augmenting Undirected Edge Connectivity in Õ(n2) Time

✍ András A Benczúr; David R Karger 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 218 KB

We give improved randomized Monte Carlo algorithms for undirected edge splitting and edge connectivity augmentation problems. Our algorithms run in time ˜2 Ž . Ž . O n on n-vertex graphs, making them an ⍀ mrn factor faster than the best known deterministic ones on m-edge graphs.