Journal
THEORETICAL COMPUTER SCIENCE
Volume 621, Issue -, Pages 37-56Publisher
ELSEVIER
DOI: 10.1016/j.tcs.2016.01.024
Keywords
Grid graph; Hamiltonian path; L-shaped grid graph; NP-complete
Categories
Ask authors/readers for more resources
Grid graphs are subgraphs of the infinite 2-dimensional integer grid. The Hamiltonian path problem for general grid graphs is a well-known NP-complete problem. In this paper, we present necessary and sufficient conditions for the existence of a Hamiltonian path between two given vertices in L-shaped grid graphs. We also show that a Hamiltonian path between two given vertices of a L-shaped grid graph can be computed in linear time. (C) 2016 Elsevier E.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available