Counting and enumerating optimum cut sets for hypergraph \(k\)-partitioning problems for fixed \(k\) (Q6560800)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7870226
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting and enumerating optimum cut sets for hypergraph \(k\)-partitioning problems for fixed \(k\) |
scientific article; zbMATH DE number 7870226 |
Statements
Counting and enumerating optimum cut sets for hypergraph \(k\)-partitioning problems for fixed \(k\) (English)
0 references
24 June 2024
0 references
hypergraphs
0 references
\(k\)-partitioning
0 references
counting
0 references
enumeration
0 references
