Finding Tight Hamilton Cycles in Random Hypergraphs Faster.

Peter Allen Christoph Koch Olaf Parczyk Yury Person

Published in: LATIN (2018)

Keyphrases

upper bound
web services
objective function
lower bound
highly efficient
real time
real world
artificial intelligence
case study
data structure
worst case
graph theory
uniformly distributed