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
v1v2 (latest)

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
ArXiv (abs)PDFHTML

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

16 / 16 papers shown
Title
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 Distance Approximation
Distributed Distance Approximation
Bertie Ancona
K. Censor-Hillel
M. Dalirrooyfard
Yuval Efron
Virginia Vassilevska Williams
69
13
0
10 Nov 2020
Computing Shortest Paths and Diameter in the Hybrid Network Model
Computing Shortest Paths and Diameter in the Hybrid Network Model
Fabian Kuhn
P. Schneider
85
30
0
15 Jun 2020
Faster Deterministic All Pairs Shortest Paths in Congest Model
Faster Deterministic All Pairs Shortest Paths in Congest Model
U. Agarwal
V. Ramachandran
45
23
0
19 May 2020
Shortest Paths in a Hybrid Network Model
Shortest Paths in a Hybrid Network Model
John E. Augustine
Kristian Hinnenthal
Fabian Kuhn
Christian Scheideler
P. Schneider
44
31
0
04 Sep 2019
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in
  the CONGEST-CLIQUE Model
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model
Taisuke Izumi
F. Gall
33
35
0
06 Jun 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
Fast Approximate Shortest Paths in the Congested Clique
Fast Approximate Shortest Paths in the Congested Clique
K. Censor-Hillel
Michal Dory
Janne H. Korhonen
Dean Leitersdorf
56
54
0
14 Mar 2019
Smaller Cuts, Higher Lower Bounds
Smaller Cuts, Higher Lower Bounds
Amir Abboud
K. Censor-Hillel
Seri Khoury
A. Paz
46
29
0
07 Jan 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
The Sparsest Additive Spanner via Multiple Weighted BFS Trees
The Sparsest Additive Spanner via Multiple Weighted BFS Trees
Ya-Ping Hsieh
Chen Liu
Volkan Cevher
43
4
0
05 Nov 2018
Distributed Triangle Detection via Expander Decomposition
Distributed Triangle Detection via Expander Decomposition
Yi-Jun Chang
Seth Pettie
Hengjie Zhang
53
47
0
17 Jul 2018
A Deterministic Distributed Algorithm for Exact Weighted All-Pairs
  Shortest Paths in $\tilde{O}(n^{3/2})$ Rounds
A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in O~(n3/2)\tilde{O}(n^{3/2})O~(n3/2) Rounds
U. Agarwal
V. Ramachandran
Valerie King
Matteo Pontecorvi
26
38
0
15 Apr 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
1