✦ LIBER ✦

Edge-Connectivity Augmentation Preserving Simplicity

✍ Scribed by Bang-Jensen, Jørgen; Jordán, Tibor

Book ID: 118199590
Publisher: Society for Industrial and Applied Mathematics
Year: 1998
Tongue: English
Weight: 410 KB
Volume: 11
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480197318878

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Successive edge-connectivity augmentatio

Successive edge-connectivity augmentation problems

✍ Eddie Cheng; Tibor Jordán 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 119 KB

Minimum Augmentation of Edge-Connectivit

Minimum Augmentation of Edge-Connectivity between

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

Edge-Connectivity Augmentation with Part

Edge-Connectivity Augmentation with Partition Constraints

✍ Bang-Jensen, JOrgen; Gabow, Harold N.; Jordán, Tibor; Szigeti, Zoltán 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 724 KB

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

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

✍ Steffen Enni 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 66 KB

Edge splitting and connectivity augmenta

Edge splitting and connectivity augmentation in directed hypergraphs

✍ Alex R. Berg; Bill Jackson; Tibor Jordán 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 262 KB

We prove theorems on edge splittings and edge-connectivity augmentation in directed hypergraphs, extending earlier results of Mader and Frank, respectively, on directed graphs.

Detachment of Vertices of Graphs Preserv

Detachment of Vertices of Graphs Preserving Edge-Connectivity

✍ Fleiner, Balázs 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 180 KB