Computing minimum multiway cuts in hypergraphs from hypertree packings (Q3569805)
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 5724193
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing minimum multiway cuts in hypergraphs from hypertree packings |
scientific article; zbMATH DE number 5724193 |
Statements
Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings (English)
0 references
22 June 2010
0 references
0.9737775921821594
0 references
0.8473083972930908
0 references
0.8432188630104065
0 references
0.8372122049331665
0 references
