Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs (Q845699)
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 5664471
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs |
scientific article; zbMATH DE number 5664471 |
Statements
Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs (English)
0 references
29 January 2010
0 references
algorithms
0 references
hypergraphs
0 references
fast matrix multiplication
0 references
0.811996579170227
0 references
0.7914559841156006
0 references
0.7753576636314392
0 references
0.7628508806228638
0 references
0.7587561011314392
0 references
