Graph partitioning using single commodity flows (Q5899510)
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 6507197
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph partitioning using single commodity flows |
scientific article; zbMATH DE number 6507197 |
Statements
Graph partitioning using single commodity flows (English)
0 references
11 November 2015
0 references
edge-separator
0 references
single commodity MAX-flow
0 references
sparse cut
0 references
spectral method
0 references
0.9989833831787108
0 references
0.8713970184326172
0 references
0.8505409955978394
0 references
0.8502029776573181
0 references
0.8260795474052429
0 references
