Graph sub-sampling for divide-and-conquer algorithms in large networks (Q6979107)
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 8045577
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph sub-sampling for divide-and-conquer algorithms in large networks |
scientific article; zbMATH DE number 8045577 |
Statements
Graph sub-sampling for divide-and-conquer algorithms in large networks (English)
0 references
26 May 2025
0 references
exploration sampling
0 references
community detection
0 references
core-periphery
0 references
mis-classification rate
0 references
network analysis
0 references
0 references
0 references
0 references
