On minimum 3-cuts and approximating k-cuts using cut trees (Q4645919)
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 7000345
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On minimum 3-cuts and approximating k-cuts using cut trees |
scientific article; zbMATH DE number 7000345 |
Statements
On minimum 3-cuts and approximating k-cuts using Cut Trees (English)
0 references
11 January 2019
0 references
minimum weight
0 references
partition tree
0 references
maximum flow problem
0 references
graph partitioning problem
0 references
bounding technique
0 references
0.8777071833610535
0 references
0.8564763069152832
0 references
0.852729856967926
0 references
