Near Optimal Bounds for Replacement Paths and Related Problems in the
CONGEST Model

v1v2 (latest)

Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model

30 May 2022

Vignesh Manoharan

V. Ramachandran

ArXiv (abs)PDF HTML

Papers citing "Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model"

8 / 8 papers shown

Title
Even-Cycle Detection in the Randomized and Quantum CONGEST Model Pierre Fraigniaud Mael Luce F. Magniez Ioan Todinca 71 8 0 19 Feb 2024
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 92 14 0 28 Oct 2022
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs K. Censor-Hillel Orr Fischer T. Gonen F. Gall Dean Leitersdorf R. Oshman 137 28 0 19 Jan 2021
Distributed Distance Approximation Bertie Ancona K. Censor-Hillel M. Dalirrooyfard Yuval Efron Virginia Vassilevska Williams 65 13 0 10 Nov 2020
Distributed Constructions of Dual-Failure Fault-Tolerant Distance Preservers M. Parter 42 11 0 04 Oct 2020
Faster Deterministic All Pairs Shortest Paths in Congest Model U. Agarwal V. Ramachandran 40 23 0 19 May 2020
A Faster Distributed Single-Source Shortest Paths Algorithm Sebastian Krinninger Danupon Nanongkai 43 65 0 03 Nov 2017
Distributed Verification and Hardness of Distributed Approximation Atish Das Sarma S. Holzer Liah Kor Amos Korman Danupon Nanongkai Gopal Pandurangan David Peleg Roger Wattenhofer 85 346 0 12 Nov 2010

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.