Login / Signup

Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs.

Vladimir GrebinskiGregory Kucherov
Published in: ISTCS (1997)
Keyphrases
  • hamiltonian cycle
  • worst case
  • traveling salesman problem
  • phase transition
  • graph coloring
  • machine learning
  • upper bound
  • optimal control
  • optimal strategy
  • optimal solution