On Hamilton paths in grid graphs
Copyright policy ) Gorbenko, A.; Popov, V.;
On Hamilton paths in grid graphs
In this paper we consider an approach to solve the Hamilton path problem for grid graphs. This approach is based on an explicit reduction from the problem to the satisfiability problem.
Russian Federation
- FEDERAL STATE AUTONOMOUS EDUCATIONAL INSTITUTION OF HIGHER PROFESSIONAL EDUCATION NOTHERN (ARCTIC) FEDERAL UNIVERSITY Russian Federation
- Ural Federal University Russian Federation
HAMILTON PATH, GRID GRAPH, NP-COMPLETE, VACUUM CLEANING ROBOT, SATISFIABILITY
HAMILTON PATH, GRID GRAPH, NP-COMPLETE, VACUUM CLEANING ROBOT, SATISFIABILITY
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
selected citations
Citations provided by BIP!
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
Citations provided by BIP!popularityPopularity provided by BIP!
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
Popularity provided by BIP! 2
Average
Average
Average
gold