$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 $\tilde{O}(n^{3/2})$ Rounds

15 April 2018

Papers citing "A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in $\tilde{O}(n^{3/2})$ Rounds"

20 / 20 papers shown

Title
A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP M. Ghaffari Anton Trygub 28 2 0 23 Sep 2024
Distributed Deterministic Exact Minimum Weight Cycle and Multi Source Shortest Paths in Near Linear Rounds in CONGEST model U. Agarwal 9 1 0 01 Oct 2023
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs Taisuke Izumi Naoki Kitamura Takamasa Naruse Gregory Schwartzman 29 5 0 30 May 2022
$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 Václav Rozhon Christoph Grunau Bernhard Haeupler Goran Zuzic Jason Li 32 29 0 12 Apr 2022
Optimizing Graph Transformer Networks with Graph-based Techniques Loc Hoang U. Agarwal G. Gill Roshan Dathathri Abhik Seal Brian Martin K. Pingali GNN 41 0 0 16 Jun 2021
Minor Sparsifiers and the Distributed Laplacian Paradigm S. Forster Gramoz Goranci Yang P. Liu Richard Peng Xiaorui Sun Mingquan Ye 38 20 0 31 Dec 2020
Distributed Distance Approximation Bertie Ancona K. Censor-Hillel M. Dalirrooyfard Yuval Efron Virginia Vassilevska Williams 40 9 0 10 Nov 2020
Distance Computations in the Hybrid Network Model via Oracle Simulations K. Censor-Hillel Dean Leitersdorf Volodymyr Polosukhin 37 18 0 26 Oct 2020
Computing Shortest Paths and Diameter in the Hybrid Network Model Fabian Kuhn P. Schneider 16 31 0 15 Jun 2020
Faster Deterministic All Pairs Shortest Paths in Congest Model U. Agarwal V. Ramachandran 12 19 0 19 May 2020
Shortest Paths in a Hybrid Network Model John E. Augustine Kristian Hinnenthal Fabian Kuhn Christian Scheideler P. Schneider 15 32 0 04 Sep 2019
Fast Approximate Shortest Paths in the Congested Clique K. Censor-Hillel Michal Dory Janne H. Korhonen Dean Leitersdorf 25 53 0 14 Mar 2019
Smaller Cuts, Higher Lower Bounds Amir Abboud K. Censor-Hillel Seri Khoury A. Paz 20 29 0 07 Jan 2019
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time A. Bernstein K. Kirchberg 16 49 0 08 Nov 2018
The Sparsest Additive Spanner via Multiple Weighted BFS Trees Ya-Ping Hsieh Chen Liu V. Cevher 12 4 0 05 Nov 2018
New and Simplified Distributed Algorithms for Weighted All Pairs Shortest Paths U. Agarwal V. Ramachandran 69 5 0 18 Oct 2018
A Deterministic Distributed Algorithm for Weighted All Pairs Shortest Paths Through Pipelining U. Agarwal V. Ramachandran 17 1 0 23 Jul 2018
Distributed Triangle Detection via Expander Decomposition Yi-Jun Chang Seth Pettie Hengjie Zhang 16 46 0 17 Jul 2018
Distributed Algorithms for Directed Betweenness Centrality and All Pairs Shortest Paths Matteo Pontecorvi V. Ramachandran GNN 13 11 0 21 May 2018
A Faster Distributed Single-Source Shortest Paths Algorithm Sebastian Krinninger Danupon Nanongkai 27 63 0 03 Nov 2017