Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth (Q6074650)
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: Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth |
scientific article; zbMATH DE number 7749480
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth |
scientific article; zbMATH DE number 7749480 |
Statements
Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth (English)
0 references
12 October 2023
0 references
hypergraphs with large girth
0 references
independent sets
0 references
randomized greedy algorithm
0 references
0.8729589581489563
0 references
0.8413435220718384
0 references
0.8120723366737366
0 references
0.8027158379554749
0 references
0.791841983795166
0 references
