Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time

v1v2 (latest)

Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time

8 November 2018

ArXiv (abs)PDF HTML

Papers citing "Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time"

17 / 17 papers shown

Title
Fast Broadcast in Highly Connected Networks Shashwat Chandra Yi-Jun Chang Michal Dory Mohsen Ghaffari Dean Leitersdorf 70 1 0 19 Apr 2024
ZePoP: A Distributed Leader Election Protocol using the Delay-based Closeness Centrality for Peer-to-Peer Applications Md. Amjad Hossain Javed Khan 28 1 0 05 Aug 2023
Optimal Message-Passing with Noisy Beeps Peter Davies 36 3 0 27 Mar 2023
Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks Xudong Wu Penghui Yao MQ 90 12 0 06 Jun 2022
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching Naoki Kitamura Taisuke Izumi 62 6 0 25 Apr 2021
Minor Sparsifiers and the Distributed Laplacian Paradigm S. Forster Gramoz Goranci Yang P. Liu Richard Peng Xiaorui Sun Mingquan Ye 87 21 0 31 Dec 2020
Distributed Distance Approximation Bertie Ancona K. Censor-Hillel M. Dalirrooyfard Yuval Efron Virginia Vassilevska Williams 98 13 0 10 Nov 2020
Computing Shortest Paths and Diameter in the Hybrid Network Model Fabian Kuhn P. Schneider 157 31 0 15 Jun 2020
Faster Deterministic All Pairs Shortest Paths in Congest Model U. Agarwal V. Ramachandran 61 23 0 19 May 2020
Shortest Paths in a Hybrid Network Model John E. Augustine Kristian Hinnenthal Fabian Kuhn Christian Scheideler P. Schneider 70 33 0 04 Sep 2019
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model Taisuke Izumi F. Gall 56 36 0 06 Jun 2019
Hardness of Distributed Optimization Nir Bachrach K. Censor-Hillel Michal Dory Yuval Efron Dean Leitersdorf A. Paz 60 41 0 24 May 2019
Distributed Edge Connectivity in Sublinear Time Mohit Daga Monika Henzinger Danupon Nanongkai Thatchaphol Saranurak 72 40 0 08 Apr 2019
Fast Approximate Shortest Paths in the Congested Clique K. Censor-Hillel Michal Dory Janne H. Korhonen Dean Leitersdorf 91 55 0 14 Mar 2019
Smaller Cuts, Higher Lower Bounds Amir Abboud K. Censor-Hillel Seri Khoury A. Paz 95 29 0 07 Jan 2019
The Sparsest Additive Spanner via Multiple Weighted BFS Trees Ya-Ping Hsieh Chen Liu Volkan Cevher 73 4 0 05 Nov 2018
Distributed Algorithms for Directed Betweenness Centrality and All Pairs Shortest Paths Matteo Pontecorvi V. Ramachandran GNN 46 11 0 21 May 2018