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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Applied mathematics and computation Jg. 436; S. 127513
Hauptverfasser:	Keshavarz-Kohjerdi, Fatemeh, Bagheri, Alireza
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.01.2023
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!