Unbalanced graph cuts with minimum capacity (Q2515430)
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 6470107
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unbalanced graph cuts with minimum capacity |
scientific article; zbMATH DE number 6470107 |
Statements
Unbalanced graph cuts with minimum capacity (English)
0 references
5 August 2015
0 references
unbalanced cut
0 references
min cut
0 references
approximation algorithm
0 references
social network
0 references
combinatorial optimization
0 references
0 references
0.8752079
0 references
0.87345964
0 references
0.87053794
0 references
0.87044406
0 references
0.86820567
0 references
0.8521174
0 references
0.8521174
0 references
0 references
0 references
