Hamiltonian Paths in Two Classes of Grid Graphs
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
TL;DR
This paper establishes conditions for Hamiltonian paths in specific grid graphs and provides a linear-time algorithm for finding such paths, advancing understanding of graph traversal in structured grids.
Contribution
It offers necessary and sufficient conditions for Hamiltonian paths in L- and C-alphabet grid graphs and introduces an efficient linear-time algorithm.
Findings
Conditions for Hamiltonian paths in L- and C-alphabet grid graphs
Linear-time algorithm for finding Hamiltonian paths in these graphs
Enhanced understanding of Hamiltonian path existence in structured grid graphs
Abstract
In this paper, we give the necessary and sufficient conditions for the existence of Hamiltonian paths in alphabet and alphabet grid graphs. We also present a linear-time algorithm for finding Hamiltonian paths in these graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Algorithms and Data Compression · DNA and Biological Computing