𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Steiner k-Edge Connected Subgraph Polyhedra

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

Book ID
110282536
Publisher
Springer US
Year
2000
Tongue
English
Weight
91 KB
Volume
4
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

k-edge subgraph problems
k-edge subgraph problems
✍ Olivier Goldschmidt; Dorit S. Hochbaum πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 743 KB

We study here a problem on graphs that involves finding a subgraph of maximum node weights spanning up to k edges. We interpret the concept of "spanning" to mean that at least one endpoint of the edge is in the subgraph in which we seek to maximize the total weight of the nodes. We discuss the compl