This paper presents near-optimal deterministic parallel and distributed algorithms for
computing (1+ eps)-approximate single-source shortest paths in any undirected weighted …

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+ ε …

Data gathering is a basic requirement in many applications of wireless sensor networks
(WSNs). Because the energy of sensors is limited, the data-gathering mechanism must be …

In this work, we use algebraic methods for studying distance computation and subgraph
detection tasks in the congested clique model. Specifically, we adapt parallel matrix …

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 …

Graph is a significant data structure that describes the relationship between entries. Many
application domains in the real world are heavily dependent on graph data. However, graph …

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 …

This paper introduces the concept of low-congestion shortcuts for (near-) planar networks,
and demonstrates their power by using them to obtain near-optimal distributed algorithms for …

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