• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

A Distributed Algorithm for Finding Hamiltonian Cycles in Random Graphs in O(\log n) Time.

Volker Turau
Published in: SIROCCO (2018)
Keyphrases
  • random graphs
  • worst case
  • optimal solution
  • np hard
  • learning algorithm
  • computational complexity
  • lower bound
  • evolutionary algorithm
  • social media
  • optimization problems
  • undirected graph