The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem.
Basil VandegriendJoseph C. CulbersonPublished in: J. Artif. Intell. Res. (1998)
Keyphrases
- hamiltonian cycle
- phase transition
- random instances
- hard problems
- random constraint satisfaction problems
- constraint satisfaction
- random sat
- graph coloring
- satisfiability problem
- np complete
- randomly generated
- combinatorial problems
- cellular automata
- sat problem
- search strategy
- heuristic search
- random walk
- special case