Distributed exact shortest paths in sublinear time
M Elkin - Journal of the ACM (JACM), 2020 - dl.acm.org
The distributed single-source shortest paths problem is one of the most fundamental and
central problems in the message-passing distributed computing. Classical Bellman-Ford …
central problems in the message-passing distributed computing. Classical Bellman-Ford …
Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based ℓ1-Oblivious Routing
We provide universally-optimal distributed graph algorithms for (1+∊)-approximate shortest
path problems including shortest-path-tree and transshipment. The universal optimality of …
path problems including shortest-path-tree and transshipment. The universal optimality of …
Single-source shortest paths in the CONGEST model with improved bound
S Chechik, D Mukhtar - Proceedings of the 39th Symposium on …, 2020 - dl.acm.org
We improve the time complexity of the single-source shortest path problem for weighted
directed graphs (with non-negative integer weights) in the Broadcast CONGEST model of …
directed graphs (with non-negative integer weights) in the Broadcast CONGEST model of …
A round-efficient distributed betweenness centrality algorithm
We present Min-Rounds BC (MRBC), a distributed-memory algorithm in the CONGEST
model that computes the betweenness centrality (BC) of every vertex in a directed …
model that computes the betweenness centrality (BC) of every vertex in a directed …
Minor sparsifiers and the distributed laplacian paradigm
We study distributed algorithms built around minor-based vertex sparsifiers, and give the first
algorithm in the CONGEST model for solving linear systems in graph Laplacian matrices to …
algorithm in the CONGEST model for solving linear systems in graph Laplacian matrices to …
Faster deterministic all pairs shortest paths in congest model
U Agarwal, V Ramachandran - … of the 32nd ACM Symposium on …, 2020 - dl.acm.org
We present a new deterministic algorithm for distributed weighted all pairs shortest paths
(APSP) in both undirected and directed graphs. Our algorithm runs in~ O (n4/3) rounds in …
(APSP) in both undirected and directed graphs. Our algorithm runs in~ O (n4/3) rounds in …
Distance computations in the hybrid network model via oracle simulations
K Censor-Hillel, D Leitersdorf, V Polosukhin - arXiv preprint arXiv …, 2020 - arxiv.org
The Hybrid network model was introduced in [Augustine et al., SODA'20] for laying down a
theoretical foundation for networks which combine two possible modes of communication …
theoretical foundation for networks which combine two possible modes of communication …
On sparsity awareness in distributed computations
K Censor-Hillel, D Leitersdorf… - Proceedings of the 33rd …, 2021 - dl.acm.org
We extract a core principle that underlies seemingly different fundamental distributed
settings, which is that sparsity awareness may induce faster algorithms for core problems in …
settings, which is that sparsity awareness may induce faster algorithms for core problems in …
Improved approximation bounds for minimum weight cycle in the congest model
V Manoharan, V Ramachandran - arXiv preprint arXiv:2308.08670, 2023 - arxiv.org
Minimum Weight Cycle (MWC) is the problem of finding a simple cycle of minimum weight in
a graph $ G=(V, E) $. This is a fundamental graph problem with classical sequential …
a graph $ G=(V, E) $. This is a fundamental graph problem with classical sequential …
Distributed distance approximation
B Ancona, K Censor-Hillel, M Dalirrooyfard… - arXiv preprint arXiv …, 2020 - arxiv.org
Diameter, radius and eccentricities are fundamental graph parameters, which are
extensively studied in various computational settings. Typically, computing approximate …
extensively studied in various computational settings. Typically, computing approximate …