𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A probabilistic algorithm for vertex connectivity of graphs

✍ Scribed by M. Becker; W. Degenhardt; J. Doenhardt; S. Hertel; G. Kaninke; W. Keber; K. Mehlhorn; S. Näher; H. Rohnert; T. Winter

Book ID
118323794
Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
215 KB
Volume
15
Category
Article
ISSN
0020-0190

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

A kind of conditional vertex connectivit
A kind of conditional vertex connectivity of star graphs
✍ Min Wan; Zhao Zhang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 380 KB

In this work, we prove that κ 2 (S n ) = 6(n -3) for n ≥ 4, where S n is the n-dimensional star graph.