Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory (Q2215966)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7285594
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Breaking the linear-memory barrier in \(\mathsf{MPC}\): fast \(\mathsf{MIS}\) on trees with strongly sublinear memory |
scientific article; zbMATH DE number 7285594 |
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
0.9806318
0 references
0.8416202
0 references
0.83787596
0 references
0.8371507
0 references
0.8351559
0 references
