On minimal cuts of recursively generated hypergraphs (Q3059622)
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: On minimal cuts of recursively generated hypergraphs |
scientific article; zbMATH DE number 5819890
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On minimal cuts of recursively generated hypergraphs |
scientific article; zbMATH DE number 5819890 |
Statements
25 November 2010
0 references
recursively generated hypergraph
0 references
minimum size of a cut
0 references
rooted tree
0 references
decomposition tree
0 references
terminal
0 references
algorithm
0 references
0.8287122845649719
0 references
0.8174607753753662
0 references
0.8141300082206726
0 references
0.8096972703933716
0 references
0.8037393093109131
0 references
