Deterministic 3-Coloring of Trees in the Sublinear MPC model

05/28/2021
by   Rustam Latypov, et al.
0

We present deterministic O(log^2 log n) time sublinear Massively Parallel Computation (MPC) algorithms for 3-coloring, maximal independent set and maximal matching in trees with n nodes. In accordance with the sublinear MPC regime, our algorithms run on machines that have memory as little as O(n^δ) for any arbitrary constant 0<δ<1. Furthermore, our algorithms use only O(n) global memory. Our main result is the 3-coloring algorithm, which contrasts the probabilistic 4-coloring algorithm of Ghaffari, Grunau and Jin [DISC'20]. The maximal independent set and maximal matching algorithms follow in O(1) time after obtaining the coloring. The key ingredient of our 3-coloring algorithm is an O(log^2 log n) time MPC implementation of a variant of the rake-and-compress tree decomposition used by Chang and Pettie [FOCS'17], which is closely related to the H-partition by Barenboim and Elkin [PODC'08]. When restricting to trees of constant maximum degree, we bring the runtime down to O(loglog n).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/22/2020

Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond

We present O(loglog n) round scalable Massively Parallel Computation alg...
research
12/17/2021

Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees

In this work, we develop the low-space Massively Parallel Computation (M...
research
08/01/2023

Conditionally Optimal Parallel Coloring of Forests

We show the first conditionally optimal deterministic algorithm for 3-co...
research
02/28/2023

Massively Parallel Computation in a Heterogeneous Regime

Massively-parallel graph algorithms have received extensive attention ov...
research
12/11/2019

Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space

The Massively Parallel Computation (MPC) model is an emerging model whic...
research
11/02/2021

Adaptive Massively Parallel Constant-round Tree Contraction

Miller and Reif's FOCS'85 classic and fundamental tree contraction algor...
research
10/03/2022

Local Computation of Maximal Independent Set

We present a randomized Local Computation Algorithm (LCA) with query com...

Please sign up or login with your details

Forgot password? Click here to reset