✦ LIBER ✦

k-edge connected polyhedra on series-parallel graphs

✍ Scribed by M.Didi Biha; A.R. Mahjoub

Book ID: 107918327
Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 607 KB
Volume: 19
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(96)00015-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Steiner k-Edge Connected Subgraph Polyhe

Steiner k-Edge Connected Subgraph Polyhedra

✍ M. Didi Biha; A.R. Mahjoub 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 91 KB

Minimally (k, k)-edge-connected graphs

✍ Kamal Hennayake; Hong-Jian Lai; Deying Li; Jingzhong Mao 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB 👁 1 views

## Abstract For an integer __l__ > 1, the __l__‐edge‐connectivity of a connected graph with at least __l__ vertices is the smallest number of edges whose removal results in a graph with __l__ components. A connected graph __G__ is (__k__, __l__)‐edge‐connected if the __l__‐edge‐connectivity of __G_

On minimally k-edge-connected graphs and

On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks

✍ Tibor Jordán 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 170 KB

A graph G = (V; E) is called minimally (k; T )-edge-connected with respect to some T ⊆ V if there exist k-edge-disjoint paths between every pair u; v ∈ T but this property fails by deleting any edge of G. We show that |V | can be bounded by a (linear) function of k and |T | if each vertex in V -T ha

On k-minimally n-edge-connected graphs

✍ Stephen B. Maurer; Peter J. Slater 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 815 KB

Paths in k-edge-connected graphs

✍ Haruko Okamura 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 562 KB

Low-connectivity network design on serie

Low-connectivity network design on series-parallel graphs

✍ S. Raghavan 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB