𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Toshimasa Ishii; Hiroshi Nagamochi; Toshihide Ibaraki

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

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Static 2-Approximation Algorithm for V
A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity
✍ Monika Rauch Henzinger πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 329 KB

This paper presents insertions-only algorithms for maintaining the exact andror approximate size of the minimum edge cut and the minimum vertex cut of a graph. Ε½ . The algorithms output the approximate or exact size k in time O 1 and a cut of size k in time linear in its size. For the minimum edge

Concept of a vertex in a matroid and 3-c
Concept of a vertex in a matroid and 3-connected graphs
✍ A. K. Kelmans πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 316 KB

## Abstract The concept of a matroid vertex is introduced. The vertices of a matroid of a 3‐connected graph are in one‐to‐one correspondence with vertices of the graph. Thence directly follows Whitney's theorem that cyclic isomorphism of 3‐connected graphs implies isomorphism. The concept of a vert