Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs (Q5145258): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:50, 8 February 2024
scientific article; zbMATH DE number 7298711
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
