Tight Bounds on Vertex Connectivity Under Sampling

A fundamental result by Karger [10] states that for any λ-edge-connected graph with n nodes, independently sampling each edge with probability p = Ω(log ( n )/λ) results in a graph that has edge connectivity Ω(λ p ), with high probability. This article proves the analogous result for vertex connecti...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	ACM transactions on algorithms 2017-05, Vol.13 (2), p.1-26
Hauptverfasser:	Censor-Hillel, Keren, Ghaffari, Mohsen, Giakkoupis, George, Haeupler, Bernhard, Kuhn, Fabian
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!