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. 1508.04747
  4. Cited By
Near-Optimal Distributed Maximum Flow

Near-Optimal Distributed Maximum Flow

19 August 2015
M. Ghaffari
Andreas Karrenbauer
Fabian Kuhn
Christoph Lenzen
B. Patt-Shamir
ArXiv (abs)PDFHTML

Papers citing "Near-Optimal Distributed Maximum Flow"

13 / 13 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
23
0
20 Apr 2020
Low Diameter Graph Decompositions by Approximate Distance Computation
Low Diameter Graph Decompositions by Approximate Distance Computation
R. Becker
Y. Emek
Christoph Lenzen
23
9
0
19 Sep 2019
Hardness of Distributed Optimization
Hardness of Distributed Optimization
Nir Bachrach
K. Censor-Hillel
Michal Dory
Yuval Efron
Dean Leitersdorf
A. Paz
51
41
0
24 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
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
A Faster Distributed Single-Source Shortest Paths Algorithm
A Faster Distributed Single-Source Shortest Paths Algorithm
Sebastian Krinninger
Danupon Nanongkai
60
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
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
104
112
0
27 Apr 2015
1