The following pages link to Hamilton Paths in Grid Graphs (Q4742820):
Displaying 50 items.
- An approximation algorithm for the longest cycle problem in solid grid graphs (Q266791) (← links)
- Euclidean movement minimization (Q306076) (← links)
- Kernelization of edge perfect code and its variants (Q317422) (← links)
- Hamiltonian cycles in linear-convex supergrid graphs (Q335338) (← links)
- Bounded-degree minimum-radius spanning trees in wireless sensor networks (Q391199) (← links)
- Hamiltonian paths in some classes of grid graphs (Q442933) (← links)
- Minimum covering with travel cost (Q454247) (← links)
- Permutation reconstruction from differences (Q463039) (← links)
- The Hamiltonian properties of supergrid graphs (Q497690) (← links)
- Bounded-angle spanning tree: modeling networks with angular constraints (Q513267) (← links)
- Boundary properties of graphs for algorithmic graph problems (Q551178) (← links)
- Reconstructing polygons from scanner data (Q553352) (← links)
- The longest path problem has a polynomial solution on interval graphs (Q639287) (← links)
- Hamiltonian properties of locally connected graphs with bounded vertex degree (Q643015) (← links)
- Approximating the longest paths in grid graphs (Q719276) (← links)
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- A linear-time algorithm for the longest path problem in rectangular grid graphs (Q765359) (← links)
- A fast algorithm for minimum weight odd circuits and cuts in planar graphs (Q813970) (← links)
- On the terminal connection problem (Q831820) (← links)
- Computing the zig-zag number of directed graphs (Q831867) (← links)
- Fault-tolerant Hamiltonicity in a class of faulty meshes (Q858843) (← links)
- Not being (super)thin or solid is hard: A study of grid Hamiltonicity (Q924074) (← links)
- Splitting (complicated) surfaces is hard (Q934027) (← links)
- Finding Hamiltonian circuits in quasi-adjoint graphs (Q955323) (← links)
- Hashiwokakero is NP-complete (Q990945) (← links)
- Hamiltonian properties of triangular grid graphs (Q998354) (← links)
- A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
- Degree-bounded minimum spanning trees (Q1028423) (← links)
- Finding Hamiltonian circuits in interval graphs (Q1066674) (← links)
- Hamiltonian circuits in interval graph generalizations (Q1092669) (← links)
- Bipartite permutation graphs (Q1092931) (← links)
- Heuristics and bounds for the travelling salesman location problem on the plane (Q1099066) (← links)
- Unit disk graphs (Q1174134) (← links)
- Watchman routes under limited visibility (Q1188285) (← links)
- Flow network design for manufacturing systems layout (Q1197683) (← links)
- Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm (Q1198484) (← links)
- Hamiltonian cycle is polynomial on cocomparability graphs (Q1201106) (← links)
- A note on the Hamiltonian circuit problem on directed path graphs (Q1262132) (← links)
- Forests, colorings and acyclic orientations of the square lattice (Q1306612) (← links)
- More on the complexity of common superstring and supersequence problems (Q1318686) (← links)
- The number of Hamiltonian paths in a rectangular grid (Q1357721) (← links)
- The maximum infection time of the \(P_3\) convexity in graphs with bounded maximum degree (Q1627866) (← links)
- Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane (Q1651693) (← links)
- Extensive facility location problems on networks: an updated review (Q1667394) (← links)
- The traveling salesman problem on grids with forbidden neighborhoods (Q1680496) (← links)
- Extended formulation for hop constrained distribution network configuration problems (Q1681271) (← links)
- Constructing edge-disjoint Steiner paths in lexicographic product networks (Q1738072) (← links)
- The Hamiltonian connectivity of rectangular supergrid graphs (Q1751246) (← links)
- Minimizing the number of switch instances on a flexible machine in polynomial time (Q1785367) (← links)
- The Hamiltonian circuit problem for circle graphs is NP-complete (Q1823687) (← links)
