ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2004.09129
  4. Cited By
Distributed Weighted Min-Cut in Nearly-Optimal Time

Distributed Weighted Min-Cut in Nearly-Optimal Time

20 April 2020
Michal Dory
Yuval Efron
Sagnik Mukhopadhyay
Danupon Nanongkai
ArXivPDFHTML

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

14 / 14 papers shown
Title
Faster Algorithms for Edge Connectivity via Random $2$-Out Contractions
Faster Algorithms for Edge Connectivity via Random 222-Out Contractions
M. Ghaffari
Krzysztof Nowicki
M. Thorup
118
49
0
02 Sep 2019
Small Cuts and Connectivity Certificates: A Fault Tolerant Approach
Small Cuts and Connectivity Certificates: A Fault Tolerant Approach
M. Parter
54
27
0
08 Aug 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
48
17
0
26 May 2019
Distributed Edge Connectivity in Sublinear Time
Distributed Edge Connectivity in Sublinear Time
Mohit Daga
Monika Henzinger
Danupon Nanongkai
Thatchaphol Saranurak
38
40
0
08 Apr 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
17
22
0
25 Jul 2018
Distributed Approximation of Minimum $k$-edge-connected Spanning
  Subgraphs
Distributed Approximation of Minimum kkk-edge-connected Spanning Subgraphs
Michal Dory
39
16
0
20 May 2018
Fast Distributed Approximation for TAP and 2-Edge-Connectivity
Fast Distributed Approximation for TAP and 2-Edge-Connectivity
K. Censor-Hillel
Michal Dory
45
12
0
09 Nov 2017
Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification
Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification
Liah Kor
Amos Korman
David Peleg
27
26
0
15 Dec 2015
Near-Optimal Distributed Maximum Flow
Near-Optimal Distributed Maximum Flow
M. Ghaffari
Andreas Karrenbauer
Fabian Kuhn
Christoph Lenzen
B. Patt-Shamir
18
51
0
19 Aug 2015
A Deterministic Almost-Tight Distributed Algorithm for Approximating
  Single-Source Shortest Paths
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths
Monika Henzinger
Sebastian Krinninger
Danupon Nanongkai
66
111
0
27 Apr 2015
Almost-Tight Distributed Minimum Cut Algorithms
Almost-Tight Distributed Minimum Cut Algorithms
Danupon Nanongkai
Hsin-Hao Su
73
54
0
04 Aug 2014
Distributed Minimum Cut Approximation
Distributed Minimum Cut Approximation
M. Ghaffari
Fabian Kuhn
37
91
0
23 May 2013
Can Quantum Communication Speed Up Distributed Computation?
Can Quantum Communication Speed Up Distributed Computation?
Michael Elkin
H. Klauck
Danupon Nanongkai
Gopal Pandurangan
78
49
0
22 Jul 2012
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
59
344
0
12 Nov 2010
1