Hamiltonian Paths in C-shaped Grid Graphs
classification
💻 cs.CC
keywords
hamiltonianc-shapedgraphsgridpathgivenverticesalgorithm
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.