Finding minimum 3-way cuts in hypergraphs (Q765477): Difference between revisions
From MaRDI portal
Latest revision as of 23:53, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Finding minimum 3-way cuts in hypergraphs |
scientific article |
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