Faster Algorithms for Edge Connectivity via Random $2$ -Out Contractions

2 September 2019

Papers citing "Faster Algorithms for Edge Connectivity via Random $2$-Out Contractions"

6 / 6 papers shown

Title
Massively Parallel Computation in a Heterogeneous Regime Orr Fischer A. Horowitz R. Oshman 12 2 0 28 Feb 2023
Near-Optimal Distributed Computation of Small Vertex Cuts M. Parter Asaf Petruschka 13 5 0 17 Nov 2022
A Nearly Time-Optimal Distributed Approximation of Minimum Cost $k$ -Edge-Connected Spanning Subgraph Michal Dory M. Ghaffari 17 2 0 09 Nov 2022
Extensions of Karger's Algorithm: Why They Fail in Theory and How They Are Useful in Practice Erik Jenner Enrique Fita Sanmartín Fred Hamprecht 18 0 0 05 Oct 2021
Minor Sparsifiers and the Distributed Laplacian Paradigm S. Forster Gramoz Goranci Yang P. Liu Richard Peng Xiaorui Sun Mingquan Ye 15 20 0 31 Dec 2020
Distributed Weighted Min-Cut in Nearly-Optimal Time Michal Dory Yuval Efron Sagnik Mukhopadhyay Danupon Nanongkai 22 21 0 20 Apr 2020