Pages that link to "Item:Q924074"

The following pages link to Not being (super)thin or solid is hard: A study of grid Hamiltonicity (Q924074):

Displaying 23 items.

• An approximation algorithm for the longest cycle problem in solid grid graphs (Q266791) (← links)
• Bounded-angle spanning tree: modeling networks with angular constraints (Q513267) (← links)
• The traveling salesman problem on grids with forbidden neighborhoods (Q1680496) (← links)
• Bent Hamilton cycles in \(d\)-dimensional grid graphs (Q1856346) (← links)
• Euclidean bottleneck bounded-degree spanning tree ratios (Q2066315) (← links)
• The complexity of symmetric connectivity in directional wireless sensor networks (Q2307492) (← links)
• Many-to-many two-disjoint path covers in cylindrical and toroidal grids (Q2341724) (← links)
• On orthogonally guarding orthogonal polygons with bounded treewidth (Q2659775) (← links)
• Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time (Q2673969) (← links)
• An Improved Strategy for Exploring a Grid Polygon (Q3408174) (← links)
• Two New Classes of Hamiltonian Graphs (Q3503520) (← links)
• (Q4691817) (← links)
• Walking through waypoints (Q5918830) (← links)
• Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs (Q6066461) (← links)
• Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)
• The Hamiltonicity and Hamiltonian-connectivity of solid supergrid graphs (Q6102214) (← links)
• 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids (Q6107029) (← links)
• Symmetric Connectivity in Wireless Sensor Networks with π/3 Directional Antennas (Q6114860) (← links)
• A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes (Q6175567) (← links)
• On-line exploration of rectangular cellular environments with a rectangular hole (Q6195347) (← links)
• Spanning closed trail and hamiltonian cycle in grid graphs (Q6487981) (← links)
• Hamiltonian (s, t)-paths in solid supergrid graphs (Q6495481) (← links)
• The Hamiltonian path graph is connected for simple \(s,t\) paths in rectangular grid graphs (Q6646753) (← links)