We present a deterministic (1+ o (1))-approximation O (n 1/2+ o (1)+ D 1+ o (1))-time
algorithm for solving the single-source shortest paths problem on distributed weighted …

Many distributed optimization algorithms achieve existentially-optimal running times,
meaning that there exists some pathological worst-case topology on which no algorithm can …

We devise new algorithms for the single-source shortest paths (SSSP) problem with non-
negative edge weights in the CONGEST model of distributed computing. While close-to …

A (β,ϵ)-hopset for a weighted undirected n-vertex graph G=(V,E) is a set of edges, whose
addition to the graph guarantees that every pair of vertices has a path between them that …

We design fast deterministic algorithms for distance computation in the CONGESTED
CLIQUE model. Our key contributions include: A (2+ ε)-approximation for all-pairs shortest …

In the distributed all-pairs shortest paths problem (APSP), every node in the weighted
undirected distributed network (the CONGEST model) needs to know the distance from …

Triangle-free graphs play a central role in graph theory, and triangle detection (or triangle
finding) as well as triangle enumeration (triangle listing) play central roles in the field of …

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 …

We present the first super-linear lower bounds for natural graph problems in the CONGEST
model, answering a long-standing open question. Specifically, we show that any exact …

For a positive parameter β, the β-bounded distance between a pair of vertices u, v in a
weighted undirected graph G=(V, E, ømega) is the length of the shortest uv path in G with at …