DeepAI AI Chat
Log In Sign Up

Deterministic Massively Parallel Algorithms for Ruling Sets

by   Shreyas Pai, et al.

In this paper we present a deterministic O(loglog n)-round algorithm for the 2-ruling set problem in the Massively Parallel Computation model with Õ(n) memory; this algorithm also runs in O(loglog n) rounds in the Congested Clique model. This is exponentially faster than the fastest known deterministic 2-ruling set algorithm for these models, which is simply the O(logΔ)-round deterministic Maximal Independent Set algorithm due to Czumaj, Davies, and Parter (SPAA 2020). Our result is obtained by derandomizing the 2-ruling set algorithm of Kothapalli and Pemmaraju (FSTTCS 2012).


Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover

We present O( n)-round algorithms in the Massively Parallel Computation ...

Conditionally Optimal Parallel Coloring of Forests

We show the first conditionally optimal deterministic algorithm for 3-co...

A Deterministic Algorithm for the MST Problem in Constant Rounds of Congested Clique

In this paper, we show that the Minimum Spanning Tree problem can be sol...

Guidesort: Simpler Optimal Deterministic Sorting for the Parallel Disk Model

A new algorithm, Guidesort, for sorting in the uniprocessor variant of t...

Parallel, Portable Algorithms for Distance-2 Maximal Independent Set and Graph Coarsening

Given a graph, finding the distance-2 maximal independent set (MIS-2) of...

The Laplacian Paradigm in Deterministic Congested Clique

In this paper, we bring the techniques of the Laplacian paradigm to the ...

Parallel Balanced Allocations: The Heavily Loaded Case

We study parallel algorithms for the classical balls-into-bins problem, ...