Hamiltonian Paths in C-shaped Grid Graphs
Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri
TL;DR
This paper investigates the Hamiltonian path problem in C-shaped grid graphs, providing necessary and sufficient conditions for existence and a linear-time algorithm to find such paths when they exist.
Contribution
It introduces a complete characterization and an efficient algorithm for Hamiltonian paths in C-shaped grid graphs, advancing understanding in this specific graph class.
Findings
Necessary and sufficient conditions for Hamiltonian paths in C-shaped grid graphs.
A linear-time algorithm for finding Hamiltonian paths in these graphs.
Identification of structural properties enabling efficient path computation.
Abstract
We study the Hamiltonian path problem in C-shaped grid graphs, and present the necessary and sufficient conditions for the existence of a Hamiltonian path between two given vertices in these graphs. We also give a linear-time algorithm for finding a Hamiltonian path between two given vertices of a C-shaped grid graph, if it exists.
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 · Computational Geometry and Mesh Generation · Graph Theory and Algorithms