$Undirected $(1+\varepsilon)$-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms$

Undirected $(1+\varepsilon)$ -Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms

12 April 2022

Papers citing "Undirected $(1+\varepsilon)$-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms"

4 / 4 papers shown

Title
Towards Universally Optimal Shortest Paths Algorithms in the Hybrid Model P. Schneider 13 0 0 09 Jun 2023
A Distributed Palette Sparsification Theorem Maxime Flin M. Ghaffari Magnús M. Halldórsson Fabian Kuhn Alexandre Nolin MoE 22 7 0 16 Jan 2023
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 21 10 0 28 Oct 2022
Exponentially Faster Shortest Paths in the Congested Clique Michal Dory M. Parter 100 23 0 06 Mar 2020