Hypergraph <i>k</i>-Cut for Fixed <i>k</i> in Deterministic Polynomial Time (Q5870380)
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: Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time |
scientific article; zbMATH DE number 7639674
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hypergraph <i>k</i>-Cut for Fixed <i>k</i> in Deterministic Polynomial Time |
scientific article; zbMATH DE number 7639674 |
Statements
Hypergraph <i>k</i>-Cut for Fixed <i>k</i> in Deterministic Polynomial Time (English)
0 references
9 January 2023
0 references
hypergraphs
0 references
\(k\)-cut
0 references
algorithms
0 references
0 references
0 references
