Sample-and-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model

@inproceedings{Kothapalli2020SampleandGatherFR,
title={Sample-and-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model},
author={Kishore Kothapalli and Shreyas Pai and S. Pemmaraju},
booktitle={FSTTCS},
year={2020}
}

Motivated by recent progress on symmetry breaking problems such as maximal independent set (MIS) and maximal matching in the low-memory Massively Parallel Computation (MPC) model (e.g., Behnezhad et al.~PODC 2019; Ghaffari-Uitto SODA 2019), we investigate the complexity of ruling set problems in this model. The MPC model has become very popular as a model for large-scale distributed computing and it comes with the constraint that the memory-per-machine is strongly sublinear in the input size… CONTINUE READING