Hwan-Gue Cho and Alexander Zelikovsky. Spanning closed trail and Hamiltonian cycle in grid graphs. In Algorithms and Computations. 6th International Symposium, ISAAC 95, pages 342-- 351, 1995. Home/Search Document Details and Download
Summary Related Articles |
This paper is cited in the following contexts:
Hamiltonian Cycles in Solid Grid Graphs (Extended Abstract) - Umans, Lenhart (Correct)
....algorithm for restricted grids, a subclass of solid grid graphs which are essentially left aligned stacks of decreasing length grid strips. However, none of the previously used methods work on general solid grid graphs, for which the problem seems significantly more difficult. Cho and Zelikovsky [CZ95], who study spanning closed Research supported in part by an NSF Graduate Research Fellowship. trails (a relaxation of Hamiltonian cycles) in a broad subclass of grid graphs called polymino, have even conjectured that for solid grid graphs, deciding Hamiltonicity is NP complete. We present a ....
Hwan-Gue Cho and Alexander Zelikovsky. Spanning closed trail and Hamiltonian cycle in grid graphs. In Algorithms and Computations. 6th International Symposium, ISAAC 95, pages 342-- 351, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC