Computing minimum multiway cuts in hypergraphs (Q1799394)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing minimum multiway cuts in hypergraphs |
scientific article; zbMATH DE number 6958409
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing minimum multiway cuts in hypergraphs |
scientific article; zbMATH DE number 6958409 |
Statements
Computing minimum multiway cuts in hypergraphs (English)
0 references
18 October 2018
0 references
hypergraph
0 references
matroid
0 references
multicut
0 references
tree packing
0 references
0 references
0 references
0.9534637
0 references
0.9338579
0 references
0.92203534
0 references
0.92203534
0 references
0.9159801
0 references
0 references
0.90675235
0 references
