Massively Parallel Computation of Matching and MIS in Sparse Graphs (Q5145260)
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 7298713
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Massively Parallel Computation of Matching and MIS in Sparse Graphs |
scientific article; zbMATH DE number 7298713 |
Statements
Massively Parallel Computation of Matching and MIS in Sparse Graphs (English)
0 references
20 January 2021
0 references
approximation algorithms
0 references
arboricity
0 references
massively parallel computation
0 references
matching
0 references
maximal independent set
0 references
sparse graphs
0 references
sublinear memory
0 references
0.8830304741859436
0 references
0.8774290680885315
0 references
0.859424352645874
0 references
