Optimizing streaming graph partitioning via a heuristic greedy method and caching strategy (Q5858999)
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: Optimizing streaming graph partitioning via a heuristic greedy method and caching strategy |
scientific article; zbMATH DE number 7333771
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimizing streaming graph partitioning via a heuristic greedy method and caching strategy |
scientific article; zbMATH DE number 7333771 |
Statements
Optimizing streaming graph partitioning via a heuristic greedy method and caching strategy (English)
0 references
15 April 2021
0 references
cache structure
0 references
streaming graph partitioning
0 references
parallel computing
0 references
complex networks
0 references
community detection
0 references
