Login / Signup

A distributed algorithm for finding Hamiltonian cycles in random graphs in O(log⁡n) time.

Volker Turau
Published in: Theor. Comput. Sci. (2020)
Keyphrases
  • random graphs
  • learning algorithm
  • np hard
  • worst case
  • optimal solution
  • computational complexity
  • search space
  • objective function
  • probabilistic model
  • dynamic programming
  • lower bound
  • evolutionary algorithm
  • gray scale