A procedure to determine optimal partitions of weighted hypergraphs through a network-flow analogy (Q1232425)
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: A procedure to determine optimal partitions of weighted hypergraphs through a network-flow analogy |
scientific article; zbMATH DE number 3536153
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A procedure to determine optimal partitions of weighted hypergraphs through a network-flow analogy |
scientific article; zbMATH DE number 3536153 |
Statements
A procedure to determine optimal partitions of weighted hypergraphs through a network-flow analogy (English)
0 references
1976
0 references
