Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs (Q5145258)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs |
scientific article; zbMATH DE number 7298711
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs |
scientific article; zbMATH DE number 7298711 |
Statements
Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs (English)
0 references
20 January 2021
0 references
random walk
0 references
sparse connectivity
0 references
spectral gap
0 references
