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. 1708.03903
  4. Cited By
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

13 August 2017
Chien-Chung Huang
Danupon Nanongkai
Thatchaphol Saranurak
ArXivPDFHTML

Papers citing "Distributed Exact Weighted All-Pairs Shortest Paths in $\tilde O(n^{5/4})$ Rounds"

11 / 11 papers shown
Title
Computing Shortest Paths and Diameter in the Hybrid Network Model
Computing Shortest Paths and Diameter in the Hybrid Network Model
Fabian Kuhn
P. Schneider
55
30
0
15 Jun 2020
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model
K. Censor-Hillel
Seri Khoury
A. Paz
60
55
0
16 May 2017
Near-Linear Lower Bounds for Distributed Distance Computations, Even in
  Sparse Networks
Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks
Amir Abboud
K. Censor-Hillel
Seri Khoury
40
75
0
17 May 2016
Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification
Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification
Liah Kor
Amos Korman
David Peleg
40
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
28
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
73
112
0
27 Apr 2015
Fast Partial Distance Estimation and Applications
Fast Partial Distance Estimation and Applications
Christoph Lenzen
B. Patt-Shamir
41
61
0
26 Dec 2014
Almost-Tight Distributed Minimum Cut Algorithms
Almost-Tight Distributed Minimum Cut Algorithms
Danupon Nanongkai
Hsin-Hao Su
78
54
0
04 Aug 2014
Distributed Minimum Cut Approximation
Distributed Minimum Cut Approximation
M. Ghaffari
Fabian Kuhn
53
91
0
23 May 2013
Fast Routing Table Construction Using Small Messages
Fast Routing Table Construction Using Small Messages
Christoph Lenzen
B. Patt-Shamir
73
75
0
21 Oct 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
80
346
0
12 Nov 2010
1