# Local Computation of Maximal Independent Set

arXiv: https://arxiv.org/abs/2210.01104 · HTML: https://mlsanity.com/paper/2210.01104/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 3 Oct 2022.

## Built on by (most cited first, 1 of 1)

- [Agnostic proper learning of monotone functions: beyond the black-box correction barrier](https://mlsanity.com/paper/2304.02700/) (2023)

## Abstract (arXiv)

We present a randomized Local Computation Algorithm (LCA) with query complexity poly(Delta) · log n for the Maximal Independent Set (MIS) problem. That is, the algorithm determines whether each node is in the computed MIS or not using poly(Delta) · log n queries to the adjacency lists of the graph, with high probability, and this can be done for different nodes simultaneously and independently. Here Delta and n denote the maximum degree and the number of nodes. This algorithm resolves a key open problem in the study of local computations and sublinear algorithms (attributed to Rubinfeld).