Hamilton Paths in Grid Graphs
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A linear time recognition algorithm for proper interval graphs
- Degree-bounded minimum spanning trees
- Finding Hamiltonian circuits in interval graphs
- Hamiltonian circuits in interval graph generalizations
- Bipartite permutation graphs
- Heuristics and bounds for the travelling salesman location problem on the plane
- Unit disk graphs
- Watchman routes under limited visibility
- Flow network design for manufacturing systems layout
- Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm
- Hamiltonian cycle is polynomial on cocomparability graphs
- A note on the Hamiltonian circuit problem on directed path graphs
- Forests, colorings and acyclic orientations of the square lattice
- More on the complexity of common superstring and supersequence problems
- The number of Hamiltonian paths in a rectangular grid
- The maximum infection time of the \(P_3\) convexity in graphs with bounded maximum degree
- Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane
- Extensive facility location problems on networks: an updated review
- The traveling salesman problem on grids with forbidden neighborhoods
- Extended formulation for hop constrained distribution network configuration problems
- Constructing edge-disjoint Steiner paths in lexicographic product networks
- The Hamiltonian connectivity of rectangular supergrid graphs
- Minimizing the number of switch instances on a flexible machine in polynomial time
- The Hamiltonian circuit problem for circle graphs is NP-complete
- Approximation algorithms for lawn mowing and milling
- Competitive on-line coverage of grid environments by a mobile robot
- Solitaire clobber
- HAMILTONian circuits in chordal bipartite graphs
- The longest path problem is polynomial on cocomparability graphs
- On the structure and complexity of the 2-connected Steiner network problem in the plane
- Matching supply and demand in a sharing economy: classification, computational complexity, and application
- Solitaire Clobber on circulant graphs
- Euclidean bottleneck bounded-degree spanning tree ratios
- Revising Johnson's table for the 21st century
- Some algorithmic results on Hamiltonicity and its variants in \(P_6\)-free graphs
- The complexity of quantum circuit mapping with fixed parameters
- Reconfiguring simple \(s\), \(t\) Hamiltonian paths in rectangular grid graphs
- Parameterized complexity of \((A,\ell)\)-path packing
- 1-complex \(s\), \(t\) Hamiltonian paths: structure and reconfiguration in rectangular grids
- Mim-width. I. Induced path problems
- Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible
- Liar's domination in unit disk graphs
- Parliament seating assignment problems
- Solitaire clobber played on Cartesian product of graphs
- An exact method for scheduling a yard crane
- Complexity of independency and cliquy trees
- A genetic algorithm for the picture maze generation problem
- Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs
- Positive semidefinite zero forcing numbers of two classes of graphs
- Reliability problems in multiple path-shaped facility location on networks
- Four-point conditions for the TSP: the complete complexity classification
- Many-to-many two-disjoint path covers in cylindrical and toroidal grids
- A linear-time algorithm for finding Hamiltonian (s,t)-paths in even-sized rectangular grid graphs with a rectangular hole
- How to sort by walking and swapping on paths and trees
- NP-hard graph problems and boundary classes of graphs
- Open problems around exact algorithms
- The location of median paths on grid graphs
- Angle-restricted tours in the plane.
- Exact algorithms for the Hamiltonian cycle problem in planar graphs
- Honey-pot constrained searching with local sensory information
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
- Solving the path cover problem on circular-arc graphs by using an approximation algorithm
- An approximation algorithm for the longest cycle problem in solid grid graphs
- Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time
- Grid exploration by a swarm of autonomous robots with minimum repetitions
- The restrained domination and independent restrained domination in extending supergrid graphs
- Token shifting on graphs
- Restrained domination and its variants in extended supergrid graphs
- Path-connectivity of lexicographic product graphs
- On multi-product lot-sizing and scheduling with multi-machine technologies
- An approximation algorithm for the longest path problem in solid grid graphs
- The maximum time of 2-neighbour bootstrap percolation in grid graphs and parametrized results
- Impartial solitaire clobber played on powers of paths
- Strong reducibility of powers of paths and powers of cycles on impartial solitaire clobber
- A mobility model for studying wireless communication and the complexity of problems in the model
- The longest path problem is polynomial on cocomparability graphs
- Euclidean movement minimization
- SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS
- Kernelization of edge perfect code and its variants
- The Longest Path Problem Is Polynomial on Interval Graphs
- The computational complexity of Portal and other 3D video games
- Solving the Rubik's Cube Optimally is NP-complete
- A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width
- Hamiltonian cycles in linear-convex supergrid graphs
- A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs
- An improved strategy for exploring a grid polygon
- How to sort by walking on a tree
- Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths
- Two New Classes of Hamiltonian Graphs
- Computing geometric minimum-dilation graphs is NP-hard
- Competitive complexity of mobile robot on-line motion planning problems
- New results about impartial solitaire clobber
- Bounded-degree minimum-radius spanning trees in wireless sensor networks
- The Hamilton circuit problem on grids
- Hamiltonian paths in some classes of grid graphs
- Minimum covering with travel cost
- Permutation reconstruction from differences
- A new lower bound for positive zero forcing
- Full cycle extendability of locally connected \(K_{1,4}\)-restricted graphs
- The bisection width of grid graphs
This page was built for publication: Hamilton Paths in Grid Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4742820)
