Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time

Fatemeh Keshavarz-Kohjerdi and Alireza Bagheri

Applied Mathematics and Computation, 2023, vol. 436, issue C

Abstract: The Hamiltonian cycle problem is an important problem in graph theory. For solid grid graphs, an O(n4)-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.

Keywords: Hamiltonian cycle problem; Solid grid graph; Truncated rectangular grid graphs; Linear-time algorithm (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300322005872
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:436:y:2023:i:c:s0096300322005872

DOI: 10.1016/j.amc.2022.127513

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().