The minimum number of \(e\)-vertex-covers among hypergraphs with \(e\) edges of given ranks (Q1003769)
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 5523223
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum number of \(e\)-vertex-covers among hypergraphs with \(e\) edges of given ranks |
scientific article; zbMATH DE number 5523223 |
Statements
The minimum number of \(e\)-vertex-covers among hypergraphs with \(e\) edges of given ranks (English)
0 references
4 March 2009
0 references
vertex-cover
0 references
hypergraph
0 references
pooling design
0 references
0.7705961465835571
0 references
0.768583357334137
0 references
0.7588966488838196
0 references
0.7557137608528137
0 references
0.7555027008056641
0 references
