Deterministic enumeration of all minimum \(k\)-cut-sets in hypergraphs for fixed \(k\) (Q6575162)
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: Deterministic enumeration of all minimum \(k\)-cut-sets in hypergraphs for fixed \(k\) |
scientific article; zbMATH DE number 7883669
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deterministic enumeration of all minimum \(k\)-cut-sets in hypergraphs for fixed \(k\) |
scientific article; zbMATH DE number 7883669 |
Statements
Deterministic enumeration of all minimum \(k\)-cut-sets in hypergraphs for fixed \(k\) (English)
0 references
19 July 2024
0 references
