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. 1911.01956
  4. Cited By
Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators

Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators

5 November 2019
Alexandr Andoni
C. Stein
Peilin Zhong
ArXiv (abs)PDFHTML

Papers citing "Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators"

16 / 16 papers shown
Title
Massively Parallel Algorithms for Approximate Shortest Paths
Massively Parallel Algorithms for Approximate Shortest Paths
Michal Dory
Shaked Matar
99
1
0
09 Dec 2024
Efficient parallel implementation of the multiplicative weight update
  method for graph-based linear programs
Efficient parallel implementation of the multiplicative weight update method for graph-based linear programs
Caleb Ju
Serif Yesil
Mengyuan Sun
C. Chekuri
Edgar Solomonik
32
0
0
06 Jul 2023
Parallel Breadth-First Search and Exact Shortest Paths and Stronger
  Notions for Approximate Distances
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
97
14
0
28 Oct 2022
A Data-dependent Approach for High Dimensional (Robust) Wasserstein
  Alignment
A Data-dependent Approach for High Dimensional (Robust) Wasserstein Alignment
Hu Ding
Wenjie Liu
Mingquan Ye
46
2
0
07 Sep 2022
Undirected $(1+\varepsilon)$-Shortest Paths via Minor-Aggregates:
  Near-Optimal Deterministic Parallel & Distributed Algorithms
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
Deterministic Massively Parallel Connectivity
Deterministic Massively Parallel Connectivity
Samantha R. Coy
A. Czumaj
81
18
0
09 Aug 2021
Ultra-Sparse Near-Additive Emulators
Ultra-Sparse Near-Additive Emulators
Michael Elkin
Shaked Matar
16
4
0
02 Jun 2021
$\ell_2$-norm Flow Diffusion in Near-Linear Time
ℓ2\ell_2ℓ2​-norm Flow Diffusion in Near-Linear Time
Li Chen
Richard Peng
Di Wang
26
0
0
30 May 2021
Efficient Stepping Algorithms and Implementations for Parallel Shortest
  Paths
Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths
Xiaojun Dong
Yan Gu
Yihan Sun
Yunming Zhang
58
33
0
13 May 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
62
22
0
31 Dec 2020
Deterministic PRAM Approximate Shortest Paths in Polylogarithmic Time
  and Slightly Super-Linear Work
Deterministic PRAM Approximate Shortest Paths in Polylogarithmic Time and Slightly Super-Linear Work
Michael Elkin
Shaked Matar
10
7
0
30 Sep 2020
Sample-and-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC
  Model
Sample-and-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model
Kishore Kothapalli
Shreyas Pai
Sriram V. Pemmaraju
74
8
0
26 Sep 2020
Massively Parallel Algorithms for Distance Approximation and Spanners
Massively Parallel Algorithms for Distance Approximation and Spanners
Amartya Shankha Biswas
Michal Dory
M. Ghaffari
Slobodan Mitrović
Yasamin Nazari
61
20
0
02 Mar 2020
Graph Sparsification for Derandomizing Massively Parallel Computation
  with Low Space
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space
A. Czumaj
Peter Davies
M. Parter
83
29
0
11 Dec 2019
Faster Parallel Algorithm for Approximate Shortest Path
Faster Parallel Algorithm for Approximate Shortest Path
Jason Li
43
52
0
05 Nov 2019
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and
  Scalable
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
Laxman Dhulipala
G. Blelloch
Julian Shun
GNN
86
150
0
14 May 2018
1