An efficient approach for large scale graph partitioning (Q2467568)
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 5229099
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient approach for large scale graph partitioning |
scientific article; zbMATH DE number 5229099 |
Statements
An efficient approach for large scale graph partitioning (English)
0 references
22 January 2008
0 references
Graph partitioning
0 references
Greedy heuristics
0 references
Workload balancing
0 references
0 references
0 references
0 references
0.8150528073310852
0 references
0.8041738867759705
0 references
0.7938845157623291
0 references
0.7889483571052551
0 references
