Finding minimum 3-way cuts in hypergraphs (Q765477)
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: Finding minimum 3-way cuts in hypergraphs |
scientific article; zbMATH DE number 6016033
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding minimum 3-way cuts in hypergraphs |
scientific article; zbMATH DE number 6016033 |
Statements
Finding minimum 3-way cuts in hypergraphs (English)
0 references
19 March 2012
0 references
graph algorithms
0 references
\(k\)-way cut
0 references
edge-weighted hypergraph
0 references
minimum 3-way cut problem
0 references
0.971644937992096
0 references
0.8849189281463623
0 references
0.8473083972930908
0 references
0.8405459523200989
0 references
