Maximum reachability preserved graph cut (Q2202008)
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 7248842
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum reachability preserved graph cut |
scientific article; zbMATH DE number 7248842 |
Statements
Maximum reachability preserved graph cut (English)
0 references
17 September 2020
0 references
reachability-preserved cut
0 references
multiway cut
0 references
complexity analysis
0 references
hardness
0 references
0.7402406930923462
0 references
0.7330126762390137
0 references
0.7282474637031555
0 references
0.7279987931251526
0 references
0.7274938225746155
0 references
