Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1412.7922
Cited By
Fast Partial Distance Estimation and Applications
26 December 2014
Christoph Lenzen
B. Patt-Shamir
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Fast Partial Distance Estimation and Applications"
14 / 14 papers shown
Title
Computing Shortest Paths and Diameter in the Hybrid Network Model
Fabian Kuhn
P. Schneider
88
30
0
15 Jun 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
Fast Approximate Shortest Paths in the Congested Clique
K. Censor-Hillel
Michal Dory
Janne H. Korhonen
Dean Leitersdorf
60
54
0
14 Mar 2019
Smaller Cuts, Higher Lower Bounds
Amir Abboud
K. Censor-Hillel
Seri Khoury
A. Paz
51
29
0
07 Jan 2019
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time
A. Bernstein
K. Kirchberg
62
53
0
08 Nov 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
Faster Distributed Shortest Path Approximations via Shortcuts
Bernhard Haeupler
Jason Li
50
36
0
11 Feb 2018
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
Sebastian Krinninger
Danupon Nanongkai
60
66
0
03 Nov 2017
Distributed Exact Weighted All-Pairs Shortest Paths in
O
~
(
n
5
/
4
)
\tilde O(n^{5/4})
O
~
(
n
5/4
)
Rounds
Chien-Chung Huang
Danupon Nanongkai
Thatchaphol Saranurak
56
45
0
13 Aug 2017
Distributed Subgraph Detection
Pierre Fraigniaud
Pedro Montealegre
Dennis Olivetti
I. Rapaport
Ioan Todinca
66
11
0
13 Jun 2017
Triangle Finding and Listing in CONGEST Networks
Taisuke Izumi
F. Gall
59
56
0
25 May 2017
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model
K. Censor-Hillel
Seri Khoury
A. Paz
75
55
0
16 May 2017
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