Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time

•In this paper, we consider the problem of finding a Hamiltonian cycle for truncated rectangular grid graphs.•The necessary conditions for these graphs to be Hamiltonian are given and a linear-time algorithm to find a Hamiltonian cycle, if there exists, is presented.•The Hamiltonian cycle problem fo...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Applied mathematics and computation Ročník 436; s. 127513
Hlavní autoři:	Keshavarz-Kohjerdi, Fatemeh, Bagheri, Alireza
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Inc 01.01.2023
Témata:	Hamiltonian cycle problem Linear-time algorithm Solid grid graph Truncated rectangular grid graphs Truncated rectangular grid graphs 05C45 05C85 Hamiltonian cycle problem Solid grid graph 68T40 05C38 Linear-time algorithm
ISSN:	0096-3003, 1873-5649
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	•In this paper, we consider the problem of finding a Hamiltonian cycle for truncated rectangular grid graphs.•The necessary conditions for these graphs to be Hamiltonian are given and a linear-time algorithm to find a Hamiltonian cycle, if there exists, is presented.•The Hamiltonian cycle problem for solid grid graphs has been solved already in time O(n4) but we solved it in less time complexity for truncated rectangular grid graphs. 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.
ISSN:	0096-3003 1873-5649
DOI:	10.1016/j.amc.2022.127513