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"

7 / 7 papers shown
Title
Fast Broadcast in Highly Connected Networks
Fast Broadcast in Highly Connected Networks
Shashwat Chandra
Yi-Jun Chang
Michal Dory
Mohsen Ghaffari
Dean Leitersdorf
21
1
0
19 Apr 2024
Near-Optimal Distributed Computation of Small Vertex Cuts
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
A Nearly Time-Optimal Distributed Approximation of Minimum Cost kkk-Edge-Connected Spanning Subgraph
Michal Dory
M. Ghaffari
17
2
0
09 Nov 2022
Deterministic Distributed Algorithms and Lower Bounds in the Hybrid
  Model
Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model
Ioannis Anagnostides
Themis Gouleakis
22
11
0
03 Aug 2021
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching
Naoki Kitamura
Taisuke Izumi
19
5
0
25 Apr 2021
Minor Sparsifiers and the Distributed Laplacian Paradigm
Minor Sparsifiers and the Distributed Laplacian Paradigm
S. Forster
Gramoz Goranci
Yang P. Liu
Richard Peng
Xiaorui Sun
Mingquan Ye
23
20
0
31 Dec 2020
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
87
49
0
02 Sep 2019
1