ResearchTrend.AI
Distributed Weighted Min-Cut in Nearly-Optimal Time

Distributed Weighted Min-Cut in Nearly-Optimal Time

Michal Dory
Yuval Efron
Sagnik Mukhopadhyay
Danupon Nanongkai
ArXivPDFHTML

Papers citing "Distributed Weighted Min-Cut in Nearly-Optimal Time"

4 / 4 papers shown
Title
Faster Algorithms for Edge Connectivity via Random $2$-Out Contractions
Faster Algorithms for Edge Connectivity via Random 22-Out Contractions
M. Ghaffari
Krzysztof Nowicki
M. Thorup
115
49
0
02 Sep 2019
Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph
Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph
Michal Dory
M. Ghaffari
42
17
0
26 May 2019
Parallel Minimum Cuts in Near-linear Work and Low Depth
Parallel Minimum Cuts in Near-linear Work and Low Depth
Barbara Geissmann
Lukas Gianinazzi
13
22
0
25 Jul 2018
Distributed Verification and Hardness of Distributed Approximation
Distributed Verification and Hardness of Distributed Approximation
Atish Das Sarma
S. Holzer
Liah Kor
Amos Korman
Danupon Nanongkai
Gopal Pandurangan
David Peleg
Roger Wattenhofer
55
344
0
12 Nov 2010

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.