Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory (Q2215966)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory |
scientific article |
Statements
Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory (English)
0 references
15 December 2020
0 references
massively parallel computation (MPC)
0 references
strongly sublinear memory
0 references
linear-memory barrier
0 references
trees
0 references
sparse graphs
0 references
maximal independent set (MIS)
0 references
0 references
0 references
