We present an Õ (log2 n) round deterministic distributed algorithm for the maximal
independent set problem. By known reductions, this round complexity extends also to …

This paper presents significantly improved deterministic algorithms for some of the key
problems in the area of distributed graph algorithms, including network decomposition …

This paper presents new deterministic and distributed low-diameter decomposition
algorithms for weighted graphs. In particular, we show that if one can efficiently compute …

In this article, we present a deterministic algorithm to compute an O (k Δ)-vertex coloring in O
(Δ/k)+ log* n rounds, where Δ is the maximum degree of the network graph and k≥ 1 can be …

In this paper we present efficient distributed algorithms for classical symmetry breaking
problems, maximal independent sets (MIS) and ruling sets, in power graphs. We work in the …

We present randomized distributed algorithms for the maximal independent set problem
(MIS) that, while keeping the time complexity nearly matching the best known, reduce the …

We consider the problem of finding a maximal independent set (MIS) in an unknown graph
by mobile agents or mobile robots. Suppose n mobile agents are initially located at arbitrary …

We study a simple random process that computes a maximal independent set (MIS) on a
general n-vertex graph. Each vertex has a binary state, black or white, where black indicates …

Recently, the in-network computing (INC) technique has been widely adopted by various
applications including the reliability-sensitive ones such as remote surgery, and …

We provide a $ O (\log^ 6\log n) $-round randomized algorithm for distance-2 coloring in
CONGEST with $\Delta^ 2+ 1$ colors. For $\Delta\gg\operatorname {poly}\log n $, this …