We present an O (log3 log n)-round distributed algorithm for the (Δ+ 1)-coloring problem,
where each node broadcasts only one O (log n)-bit message per round to its neighbors …

In the semi-streaming model for processing massive graphs, an algorithm makes multiple
passes over the edges of a given n-vertex graph and is tasked with computing the solution to …

A seminal palette sparsification result of Assadi, Chen, and Khanna states that in every $ n $-
vertex graph of maximum degree $\Delta $, sampling $\Theta (\log n) $ colors per vertex …

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 …

The palette sparsification theorem (PST) of Assadi, Chen, and Khanna (SODA 2019) states
that in every graph G with maximum degree Δ, sampling a list of O (log n) colors from {1 …

In the semi-streaming model for processing massive graphs, an algorithm makes multiple
passes over the edges of a given $ n $-vertex graph and is tasked with computing the …

Graph coloring is fundamental to distributed computing. We give the first general treatment
of the coloring of virtual graphs, where the graph $ H $ to be colored is locally embedded …

Graph coloring is fundamental to distributed computing. We give an ultrafast distributed
algorithm for coloring cluster graphs. These graphs are obtained from the underlying …

Given positive integers $ k\leq m $ and a graph $ G $, a family of lists $ L=\{L (v): v\in V (G)\}
$ is said to be a random $(k, m) $-list-assignment if for every $ v\in V (G) $ the list $ L (v) $ is …