Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time

3 March 2019

Papers citing "Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time"

7 / 7 papers shown

Title
Distributed Symmetry Breaking on Power Graphs via Sparsification Yannic Maus Saku Peltonen Jara Uitto 63 11 0 14 Feb 2023
Distributed Graph Coloring Made Easy Yannic Maus 56 25 0 12 May 2021
Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers M. Parter 42 11 0 04 Oct 2020
Deterministic PRAM Approximate Shortest Paths in Polylogarithmic Time and Slightly Super-Linear Work Michael Elkin Shaked Matar 10 7 0 30 Sep 2020
Exponentially Faster Shortest Paths in the Congested Clique Michal Dory M. Parter 131 23 0 06 Mar 2020
Fast Deterministic Constructions of Linear-Size Spanners and Skeletons Michael Elkin Shaked Matar 12 0 0 25 Jul 2019
The Sparsest Additive Spanner via Multiple Weighted BFS Trees Ya-Ping Hsieh Chen Liu Volkan Cevher 58 4 0 05 Nov 2018