Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1712.09121
Cited By
v1
v2
v3
v4 (latest)
Improved Distributed Algorithms for Exact Shortest Paths
25 December 2017
M. Ghaffari
Jason Li
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Improved Distributed Algorithms for Exact Shortest Paths"
21 / 21 papers shown
Title
A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP
M. Ghaffari
Anton Trygub
61
4
0
23 Sep 2024
Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances
Václav Rozhon
Bernhard Haeupler
A. Martinsson
Christoph Grunau
Goran Zuzic
92
14
0
28 Oct 2022
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs
Taisuke Izumi
Naoki Kitamura
Takamasa Naruse
Gregory Schwartzman
54
5
0
30 May 2022
Undirected
(
1
+
ε
)
(1+\varepsilon)
(
1
+
ε
)
-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms
Václav Rozhon
Christoph Grunau
Bernhard Haeupler
Goran Zuzic
Jason Li
58
29
0
12 Apr 2022
Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths
Xiaojun Dong
Yan Gu
Yihan Sun
Yunming Zhang
58
33
0
13 May 2021
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching
Naoki Kitamura
Taisuke Izumi
60
5
0
25 Apr 2021
Minor Sparsifiers and the Distributed Laplacian Paradigm
S. Forster
Gramoz Goranci
Yang P. Liu
Richard Peng
Xiaorui Sun
Mingquan Ye
62
22
0
31 Dec 2020
Distributed Distance Approximation
Bertie Ancona
K. Censor-Hillel
M. Dalirrooyfard
Yuval Efron
Virginia Vassilevska Williams
74
13
0
10 Nov 2020
Distance Computations in the Hybrid Network Model via Oracle Simulations
K. Censor-Hillel
Dean Leitersdorf
Volodymyr Polosukhin
57
17
0
26 Oct 2020
Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
Michel Feldmann
Kristian Hinnenthal
Christian Scheideler
44
22
0
02 Jul 2020
Faster Deterministic All Pairs Shortest Paths in Congest Model
U. Agarwal
V. Ramachandran
53
23
0
19 May 2020
Shortest Paths in a Hybrid Network Model
John E. Augustine
Kristian Hinnenthal
Fabian Kuhn
Christian Scheideler
P. Schneider
47
31
0
04 Sep 2019
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
Mohit Daga
Monika Henzinger
Danupon Nanongkai
Thatchaphol Saranurak
55
40
0
08 Apr 2019
Fast Approximate Shortest Paths in the Congested Clique
K. Censor-Hillel
Michal Dory
Janne H. Korhonen
Dean Leitersdorf
61
54
0
14 Mar 2019
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
Ya-Ping Hsieh
Chen Liu
Volkan Cevher
52
4
0
05 Nov 2018
New and Simplified Distributed Algorithms for Weighted All Pairs Shortest Paths
U. Agarwal
V. Ramachandran
89
5
0
18 Oct 2018
A Deterministic Distributed Algorithm for Weighted All Pairs Shortest Paths Through Pipelining
U. Agarwal
V. Ramachandran
41
1
0
23 Jul 2018
A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in
O
~
(
n
3
/
2
)
\tilde{O}(n^{3/2})
O
~
(
n
3/2
)
Rounds
U. Agarwal
V. Ramachandran
Valerie King
Matteo Pontecorvi
28
38
0
15 Apr 2018
A Faster Distributed Single-Source Shortest Paths Algorithm
Sebastian Krinninger
Danupon Nanongkai
66
66
0
03 Nov 2017
1