Random $k$ -out subgraph leaves only $O(n/k)$ inter-component edges

24 September 2019

Papers citing "Random $k$-out subgraph leaves only $O(n/k)$ inter-component edges"

1 / 1 papers shown

Title
Faster Algorithms for Edge Connectivity via Random $2$ -Out Contractions M. Ghaffari Krzysztof Nowicki M. Thorup 154 49 0 02 Sep 2019

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.

Random kkk-out subgraph leaves only O(n/k)O(n/k)O(n/k) inter-component edges

Papers citing "Random $k$-out subgraph leaves only $O(n/k)$ inter-component edges"

Random $k$ -out subgraph leaves only $O(n/k)$ inter-component edges