An O(N) Time Algorithm for Finding Hamilton Cycles with High Probability.
Rajko NenadovAngelika StegerPascal SuPublished in: ITCS (2021)
Keyphrases
- dynamic programming
- experimental evaluation
- detection algorithm
- learning algorithm
- objective function
- improved algorithm
- optimization algorithm
- expectation maximization
- computational complexity
- cost function
- clustering method
- worst case
- high accuracy
- recognition algorithm
- theoretical analysis
- neural network
- probabilistic model
- np hard
- linear programming
- semi supervised
- matching algorithm
- times faster
- k means
- selection algorithm
- search space
- high efficiency