The densest \(k\)-subhypergraph problem (Q3174693)
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: The densest k-subhypergraph problem |
scientific article; zbMATH DE number 6904888
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The densest \(k\)-subhypergraph problem |
scientific article; zbMATH DE number 6904888 |
Statements
The Densest $k$-Subhypergraph Problem (English)
0 references
18 July 2018
0 references
denseness
0 references
hypergraph
0 references
approximation
0 references
0 references
0 references
0 references
0.9882825016975404
0 references
0.8328567147254944
0 references
0.8243134021759033
0 references
0.8106749653816223
0 references
