Massively Parallel Ruling Set Made Deterministic

TL;DR

This work presents a deterministic algorithm that computes a $2-Ruling Set in $\tilde O(\sqrt{\log n})$ rounds deterministically and is the first deterministic ruling set algorithm with sublogarithmic round complexity.

Abstract

We study the deterministic complexity of the $2$-Ruling Set problem in the model of Massively Parallel Computation (MPC) with linear and strongly sublinear local memory. Linear MPC: We present a constant-round deterministic algorithm for the $2$-Ruling Set problem that matches the randomized round complexity recently settled by Cambus, Kuhn, Pai, and Uitto [DISC'23], and improves upon the deterministic $O(\log \log n)$-round algorithm by Pai and Pemmaraju [PODC'22]. Our main ingredient is a simpler analysis of CKPU's algorithm based solely on bounded independence, which makes its efficient derandomization possible. Sublinear MPC: We present a deterministic algorithm that computes a $2$-Ruling Set in $\tilde O(\sqrt{\log n})$ rounds deterministically. Notably, this is the first deterministic ruling set algorithm with sublogarithmic round complexity, improving on the $O(\log Δ+ \log \log^* n)$-round complexity that stems from the deterministic MIS algorithm of Czumaj, Davies, and Parter [TALG'21]. Our result is based on a simple and fast randomness-efficient construction that achieves the same sparsification as that of the randomized $\tilde O(\sqrt{\log n})$-round LOCAL algorithm by Kothapalli and Pemmaraju [FSTTCS'12].

Theorems & Definitions (37)

• Theorem 1.1
• Theorem 1.2
• Lemma 2.1: ABI86CG89EGL+98
• Lemma 2.2: Lemma 2.3 of BR94
• Definition 3.1: Good Node
• Definition 3.2: Bad Node Classes
• Definition 3.3: Lucky Bad Nodes
• Lemma 3.4
• proof
• Lemma 3.5