The Gn,m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
Joseph C. CulbersonBasil VandegriendPublished in: CoRR (2011)
Keyphrases
- hamiltonian cycle
- phase transition
- random instances
- hard problems
- random constraint satisfaction problems
- random sat
- constraint satisfaction
- graph coloring
- satisfiability problem
- randomly generated
- combinatorial problems
- np complete
- constraint satisfaction problems
- traveling salesman problem
- cellular automata
- sat problem
- orders of magnitude