General Sparse Matrix-Matrix Multiplication (SpGEMM) has attracted much attention from
researchers in graph analyzing, scientific computing, and deep learning. Many optimization …

We present O (loglog n)-round algorithms in the Massively Parallel Computation (MPC)
model, with Õ (n) memory per machine, that compute a maximal independent set, a 1+ ε …

In this paper, we present new randomized algorithms that improve the complexity of the
classic (Δ+ 1)-coloring problem, and its generalization (Δ+ 1)-list-coloring, in three well …

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 …

We study two fundamental graph problems, Graph Connectivity (GC) and Minimum
Spanning Tree (MST), in the well-studied Congested Clique model, and present several …

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 …

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 present a method for solving the transshipment problem-also known as uncapacitated
minimum cost flow-up to a multiplicative error of $1+\varepsilon $ in undirected graphs with …

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