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. 1305.5520
  4. Cited By
Distributed Minimum Cut Approximation
v1v2 (latest)

Distributed Minimum Cut Approximation

23 May 2013
M. Ghaffari
Fabian Kuhn
ArXiv (abs)PDFHTML

Papers citing "Distributed Minimum Cut Approximation"

23 / 23 papers shown
Title
A Distributed Palette Sparsification Theorem
A Distributed Palette Sparsification Theorem
Maxime Flin
M. Ghaffari
Magnús M. Halldórsson
Fabian Kuhn
Alexandre Nolin
MoE
49
7
0
16 Jan 2023
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching
Naoki Kitamura
Taisuke Izumi
55
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
53
22
0
31 Dec 2020
Distributed Weighted Min-Cut in Nearly-Optimal Time
Distributed Weighted Min-Cut in Nearly-Optimal Time
Michal Dory
Yuval Efron
Sagnik Mukhopadhyay
Danupon Nanongkai
63
22
0
20 Apr 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
157
50
0
02 Sep 2019
Small Cuts and Connectivity Certificates: A Fault Tolerant Approach
Small Cuts and Connectivity Certificates: A Fault Tolerant Approach
M. Parter
68
28
0
08 Aug 2019
What graph neural networks cannot learn: depth vs width
What graph neural networks cannot learn: depth vs width
Andreas Loukas
GNN
93
301
0
06 Jul 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
66
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
55
40
0
08 Apr 2019
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time
A. Bernstein
K. Kirchberg
62
53
0
08 Nov 2018
Distributed Approximation of Minimum $k$-edge-connected Spanning
  Subgraphs
Distributed Approximation of Minimum kkk-edge-connected Spanning Subgraphs
Michal Dory
53
16
0
20 May 2018
Minor Excluded Network Families Admit Fast Distributed Algorithms
Minor Excluded Network Families Admit Fast Distributed Algorithms
Bernhard Haeupler
Jason Li
Goran Zuzic
46
32
0
18 Jan 2018
Improved Distributed Algorithms for Exact Shortest Paths
Improved Distributed Algorithms for Exact Shortest Paths
M. Ghaffari
Jason Li
57
60
0
25 Dec 2017
A Faster Distributed Single-Source Shortest Paths Algorithm
A Faster Distributed Single-Source Shortest Paths Algorithm
Sebastian Krinninger
Danupon Nanongkai
58
66
0
03 Nov 2017
Distributed Exact Weighted All-Pairs Shortest Paths in $\tilde
  O(n^{5/4})$ Rounds
Distributed Exact Weighted All-Pairs Shortest Paths in O~(n5/4)\tilde O(n^{5/4})O~(n5/4) Rounds
Chien-Chung Huang
Danupon Nanongkai
Thatchaphol Saranurak
51
45
0
13 Aug 2017
Triangle Finding and Listing in CONGEST Networks
Triangle Finding and Listing in CONGEST Networks
Taisuke Izumi
F. Gall
56
56
0
25 May 2017
Distributed Construction of Purely Additive Spanners
Distributed Construction of Purely Additive Spanners
K. Censor-Hillel
T. Kavitha
A. Paz
Amir Yehudayoff
38
17
0
19 Jul 2016
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
101
112
0
27 Apr 2015
Almost-Tight Distributed Minimum Cut Algorithms
Almost-Tight Distributed Minimum Cut Algorithms
Danupon Nanongkai
Hsin-Hao Su
90
54
0
04 Aug 2014
Near-Optimal Distributed Approximation of Minimum-Weight Connected
  Dominating Set
Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set
M. Ghaffari
55
19
0
30 Apr 2014
A Distributed Minimum Cut Approximation Scheme
A Distributed Minimum Cut Approximation Scheme
Hsin-Hao Su
45
5
0
21 Jan 2014
Distributed Connectivity Decomposition
Distributed Connectivity Decomposition
K. Censor-Hillel
M. Ghaffari
Fabian Kuhn
98
58
0
21 Nov 2013
Can Quantum Communication Speed Up Distributed Computation?
Can Quantum Communication Speed Up Distributed Computation?
Michael Elkin
H. Klauck
Danupon Nanongkai
Gopal Pandurangan
116
50
0
22 Jul 2012
1