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

8 November 2018

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

8 / 8 papers shown

Title
Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks Xudong Wu Penghui Yao MQ 27 10 0 06 Jun 2022
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching Naoki Kitamura Taisuke Izumi 32 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 28 19 0 31 Dec 2020
Distributed Distance Approximation Bertie Ancona K. Censor-Hillel M. Dalirrooyfard Yuval Efron Virginia Vassilevska Williams 30 9 0 10 Nov 2020
Computing Shortest Paths and Diameter in the Hybrid Network Model Fabian Kuhn P. Schneider 6 31 0 15 Jun 2020
Hardness of Distributed Optimization Nir Bachrach K. Censor-Hillel Michal Dory Yuval Efron Dean Leitersdorf A. Paz 15 41 0 24 May 2019
Dense Subgraphs on Dynamic Networks Atish Das Sarma Ashwin Lall Danupon Nanongkai Amitabh Trehan 78 21 0 07 Aug 2012
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model Maleq Khan V. S. Anil Kumar Gopal Pandurangan Guanhong Pei 90 109 0 06 Jun 2012