An approximation algorithm for the longest cycle problem in solid grid graphs

Asghar Asgharian Sardroud, Alireza Bagheri

Although, the Hamiltonicity of solid grid graphs are polynomial-time decidable, the complexity of the longest cycle problem in these graphs is still open. In this paper, by present…