Local Computation of Maximal Independent Set

We present a randomized Local Computation Algorithm (LCA) with query complexity poly (\Delta) \cdot \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)\cdot\log n queries to the adjacency lists of...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings / annual Symposium on Foundations of Computer Science s. 438 - 449
Hlavní autor: Ghaffari, Mohsen
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.10.2022
Témata:
Complexity theory
Computer science
local computation algorithms
maximal independent set
sublinear algorithms
ISSN:2575-8454
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We present a randomized Local Computation Algorithm (LCA) with query complexity poly (\Delta) \cdot \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)\cdot\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).
ISSN:2575-8454
DOI:10.1109/FOCS54457.2022.00049