Journal
APPLIED MATHEMATICS AND COMPUTATION
Volume 436, Issue -, Pages -Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2022.127513
Keywords
Hamiltonian cycle problem; Solid grid graph; Truncated rectangular grid graphs; Linear-time algorithm
Categories
Ask authors/readers for more resources
This paper solves the problem for a special class of solid grid graphs, i.e. truncated rectangular grid graphs, in linear time.
The Hamiltonian cycle problem is an important problem in graph theory. For solid grid graphs, an O(n(4))-time algorithm has been given. In this paper, we solve the problem for a special class of solid grid graphs, i.e. truncated rectangular grid graphs, in linear time. (c) 2022 Elsevier Inc. 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
Share Paper
