Optimal covering tours with turn costs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Convertibility among Grid Filling Curves
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
On the Competitive Complexity of Navigation Tasks
Revised Papers from the International Workshop on Sensor Based Intelligent Robots
Spanning 2-connected subgraphs in alphabet graphs, special classes of grid graphs
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
External-memory depth-first search algorithm for solid grid graphs
Information Processing Letters
An external-memory depth-first search algorithm for general grid graphs
Theoretical Computer Science
An algorithm for computing simple k-factors
Information Processing Letters
Not being (super)thin or solid is hard: A study of grid Hamiltonicity
Computational Geometry: Theory and Applications
External-memory depth-first search algorithm for solid grid graphs
Information Processing Letters
A linear-time algorithm for the longest path problem in rectangular grid graphs
Discrete Applied Mathematics
Exploring simple grid polygons
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
One-Sided monge TSP is NP-Hard
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
An efficient parallel algorithm for the longest path problem in meshes
The Journal of Supercomputing
| Hi-index | 0.00 |
A grid graph is a finite node-induced subgraph of the infinite two-dimensional integer grid. A solid grid graph is a grid graph without holes. For general grid graphs, the Hamiltonian cycle problem is known to be NP-complete. We give a polynomial-time algorithm for the Hamiltonian cycle problem in solid grid graphs, resolving a longstanding open question posed in [IPS82]. In fact, our algorithm can identify Hamiltonian cycles in quad-quad graphs, a class of graphs that properly includes solid grid graphs.