Finding tight Hamilton cycles in random hypergraphs faster (Q2294678)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding tight Hamilton cycles in random hypergraphs faster |
scientific article |
Statements
Finding tight Hamilton cycles in random hypergraphs faster (English)
0 references
12 February 2020
0 references
\(r\)-uniform hypergraph
0 references
randomised polynomial time algorithm
0 references
edge probability
0 references
