v1v2v3v4 (latest)

A Faster Distributed Single-Source Shortest Paths Algorithm

3 November 2017

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

24 / 24 papers shown

Title
A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP M. Ghaffari Anton Trygub 61 4 0 23 Sep 2024
A Survey of Distributed Graph Algorithms on Massive Graphs Lingkai Meng Yu Shao Long Yuan Longbin Lai Peng Cheng Xue Li Wenyuan Yu Wenjie Zhang Xuemin Lin Jingren Zhou 74 15 0 09 Apr 2024
WindGP: Efficient Graph Partitioning on Heterogenous Machines Li Zeng Haohan Huang Binfan Zheng Kang Yang Sheng Cheng Shao Jinhua Zhou Jun Xie Rongqian Zhao Xin Chen 37 0 0 01 Mar 2024
Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model Vignesh Manoharan V. Ramachandran 48 3 0 16 Aug 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 97 14 0 28 Oct 2022
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs Taisuke Izumi Naoki Kitamura Takamasa Naruse Gregory Schwartzman 54 5 0 30 May 2022
Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model Vignesh Manoharan V. Ramachandran 62 4 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 58 29 0 12 Apr 2022
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching Naoki Kitamura Taisuke Izumi 60 5 0 25 Apr 2021
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
Distributed Distance Approximation Bertie Ancona K. Censor-Hillel M. Dalirrooyfard Yuval Efron Virginia Vassilevska Williams 74 13 0 10 Nov 2020
Distance Computations in the Hybrid Network Model via Oracle Simulations K. Censor-Hillel Dean Leitersdorf Volodymyr Polosukhin 57 17 0 26 Oct 2020
Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs Michel Feldmann Kristian Hinnenthal Christian Scheideler 44 22 0 02 Jul 2020
Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators Alexandr Andoni C. Stein Peilin Zhong 42 56 0 05 Nov 2019
Faster Parallel Algorithm for Approximate Shortest Path Jason Li 43 52 0 05 Nov 2019
Low Diameter Graph Decompositions by Approximate Distance Computation R. Becker Y. Emek Christoph Lenzen 26 9 0 19 Sep 2019
Shortest Paths in a Hybrid Network Model John E. Augustine Kristian Hinnenthal Fabian Kuhn Christian Scheideler P. Schneider 47 31 0 04 Sep 2019
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model Taisuke Izumi F. Gall 33 35 0 06 Jun 2019
Distributed Edge Connectivity in Sublinear Time Mohit Daga Monika Henzinger Danupon Nanongkai Thatchaphol Saranurak 55 40 0 08 Apr 2019
Fast Approximate Shortest Paths in the Congested Clique K. Censor-Hillel Michal Dory Janne H. Korhonen Dean Leitersdorf 61 54 0 14 Mar 2019
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time A. Bernstein K. Kirchberg 62 53 0 08 Nov 2018
New and Simplified Distributed Algorithms for Weighted All Pairs Shortest Paths U. Agarwal V. Ramachandran 89 5 0 18 Oct 2018
A Deterministic Distributed Algorithm for Weighted All Pairs Shortest Paths Through Pipelining U. Agarwal V. Ramachandran 41 1 0 23 Jul 2018
Distributed Triangle Detection via Expander Decomposition Yi-Jun Chang Seth Pettie Hengjie Zhang 56 47 0 17 Jul 2018