ResearchTrend.AI
  • Papers
  • Communities
  • Organizations
  • Events
  • Blog
  • Pricing
  • Feedback
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1804.05441
  4. Cited By
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

15 April 2018
U. Agarwal
V. Ramachandran
Valerie King
Matteo Pontecorvi
ArXiv (abs)PDFHTML

Papers citing "A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in $\tilde{O}(n^{3/2})$ Rounds"

13 / 13 papers shown
Title
Optimizing Graph Transformer Networks with Graph-based Techniques
Optimizing Graph Transformer Networks with Graph-based Techniques
Loc Hoang
U. Agarwal
G. Gill
Roshan Dathathri
Abhik Seal
Brian Martin
K. Pingali
GNN
74
0
0
16 Jun 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
87
21
0
31 Dec 2020
Distributed Distance Approximation
Distributed Distance Approximation
Bertie Ancona
K. Censor-Hillel
M. Dalirrooyfard
Yuval Efron
Virginia Vassilevska Williams
98
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
157
31
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
61
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
70
33
0
04 Sep 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
91
55
0
14 Mar 2019
Smaller Cuts, Higher Lower Bounds
Smaller Cuts, Higher Lower Bounds
Amir Abboud
K. Censor-Hillel
Seri Khoury
A. Paz
95
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
91
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
73
4
0
05 Nov 2018
Distributed Triangle Detection via Expander Decomposition
Distributed Triangle Detection via Expander Decomposition
Yi-Jun Chang
Seth Pettie
Hengjie Zhang
68
48
0
17 Jul 2018
Distributed Algorithms for Directed Betweenness Centrality and All Pairs
  Shortest Paths
Distributed Algorithms for Directed Betweenness Centrality and All Pairs Shortest Paths
Matteo Pontecorvi
V. Ramachandran
GNN
46
11
0
21 May 2018
A Faster Distributed Single-Source Shortest Paths Algorithm
A Faster Distributed Single-Source Shortest Paths Algorithm
Sebastian Krinninger
Danupon Nanongkai
109
66
0
03 Nov 2017
1