A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Faster Algorithms for Edge Connectivity via Random 2-Out Contractions
[article]
2019
arXiv
pre-print
We provide a simple new randomized contraction approach to the global minimum cut problem for simple undirected graphs. The contractions exploit 2-out edge sampling from each vertex rather than the standard uniform edge sampling. We demonstrate the power of our new approach by obtaining better algorithms for sequential, distributed, and parallel models of computation. Our end results include the following randomized algorithms for computing edge connectivity with high probability: – Two
arXiv:1909.00844v1
fatcat:hczlexnxm5do7ak57djtbjjg4u