Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\) (Q6608037)
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 cut-sets and k-cut-sets in hypergraphs for fixed k |
scientific article; zbMATH DE number 7915918
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\) |
scientific article; zbMATH DE number 7915918 |
Statements
Deterministic enumeration of all minimum cut-sets and \(k\)-cut-sets in hypergraphs for fixed \(k\) (English)
0 references
19 September 2024
0 references
0 references
0 references
0.888985276222229
0 references
0.8372963666915894
0 references
0.8360937237739563
0 references
0.816844642162323
0 references
