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. 1711.01364
  4. Cited By
A Faster Distributed Single-Source Shortest Paths Algorithm
v1v2v3v4 (latest)

A Faster Distributed Single-Source Shortest Paths Algorithm

3 November 2017
Sebastian Krinninger
Danupon Nanongkai
ArXiv (abs)PDFHTML

Papers citing "A Faster Distributed Single-Source Shortest Paths Algorithm"

17 / 17 papers shown
Title
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
21
38
0
15 Apr 2018
Faster Distributed Shortest Path Approximations via Shortcuts
Faster Distributed Shortest Path Approximations via Shortcuts
Bernhard Haeupler
Jason Li
31
36
0
11 Feb 2018
Round- and Message-Optimal Distributed Graph Algorithms
Round- and Message-Optimal Distributed Graph Algorithms
Bernhard Haeupler
D Ellis Hershkowitz
David Wajc
34
5
0
16 Jan 2018
Improved Distributed Algorithms for Exact Shortest Paths
Improved Distributed Algorithms for Exact Shortest Paths
M. Ghaffari
Jason Li
38
60
0
25 Dec 2017
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
Chien-Chung Huang
Danupon Nanongkai
Thatchaphol Saranurak
37
45
0
13 Aug 2017
Distributed Approximation of Maximum Independent Set and Maximum
  Matching
Distributed Approximation of Maximum Independent Set and Maximum Matching
R. Bar-Yehuda
K. Censor-Hillel
M. Ghaffari
Gregory Schwartzman
49
51
0
01 Aug 2017
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
75
112
0
27 Apr 2015
Algebraic Methods in the Congested Clique
Algebraic Methods in the Congested Clique
K. Censor-Hillel
P. Kaski
Janne H. Korhonen
Christoph Lenzen
A. Paz
Jukka Suomela
35
159
0
17 Mar 2015
Fast Partial Distance Estimation and Applications
Fast Partial Distance Estimation and Applications
Christoph Lenzen
B. Patt-Shamir
46
62
0
26 Dec 2014
Almost-Tight Distributed Minimum Cut Algorithms
Almost-Tight Distributed Minimum Cut Algorithms
Danupon Nanongkai
Hsin-Hao Su
83
54
0
04 Aug 2014
Near-Optimal Distributed Approximation of Minimum-Weight Connected
  Dominating Set
Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set
M. Ghaffari
41
19
0
30 Apr 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
81
76
0
21 Oct 2012
Can Quantum Communication Speed Up Distributed Computation?
Can Quantum Communication Speed Up Distributed Computation?
Michael Elkin
H. Klauck
Danupon Nanongkai
Gopal Pandurangan
81
50
0
22 Jul 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
85
346
0
12 Nov 2010
1