Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space (Q5032024)
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 7475095
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space |
scientific article; zbMATH DE number 7475095 |
Statements
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space (English)
0 references
16 February 2022
0 references
massively parallel computation
0 references
derandomization
0 references
maximal independent set
0 references
maximal matching
0 references
sparsification
0 references
0.8830304741859436
0 references
0.853675365447998
0 references
0.8114911913871765
0 references
