Author(s): A. Gorbenko | V. Popov
Journal: Advanced Studies in Theoretical Physics
ISSN 1313-1311
Volume: 7;
Issue: 3;
Start page: 127;
Date: 2013;
VIEW PDF
DOWNLOAD PDF 
Original page
Keywords: 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.
Journal: Advanced Studies in Theoretical Physics
ISSN 1313-1311
Volume: 7;
Issue: 3;
Start page: 127;
Date: 2013;
VIEW PDF
DOWNLOAD PDF Original pageKeywords: 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.
