Algorithms for the determination of cutsets in a hypergraph (Q805260)
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: Algorithms for the determination of cutsets in a hypergraph |
scientific article; zbMATH DE number 4203746
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for the determination of cutsets in a hypergraph |
scientific article; zbMATH DE number 4203746 |
Statements
Algorithms for the determination of cutsets in a hypergraph (English)
0 references
1990
0 references
network problem
0 references
hypergraph
0 references
minimal cutsets
0 references
polynomial complex
0 references
0 references
0 references
0.90419793
0 references
0.90201503
0 references
0.9003496
0 references
0.90032065
0 references
