|
|
On Hamilton paths in grid graphsKeywords: Hamilton path , grid graph , NP-complete , satisfiability , vacuum cleaning robot Abstract: In this paper we consider an approach to solve the Hamilton pathproblem for grid graphs. This approach is based on an explicit reductionfrom the problem to the satisfiability problem.
|
