An efficient algorithm for constructing Hamiltonian paths in meshes
From MaRDI portal
Recommendations
- Parallel construction of Hamiltonian paths for conforming tetrahedral meshes
- scientific article; zbMATH DE number 4031743
- Existence and construction of Hamiltonian paths and cycles on conforming tetrahedral meshes
- A linear-time algorithm for finding Hamiltonian (s,t)-paths in even-sized rectangular grid graphs with a rectangular hole
- A simple linear expected time algorithm for finding a Hamilton path
Cited in
(25)- The Hamiltonian connectivity of rectangular supergrid graphs
- Fast algorithms for computing self-avoiding walks and mesh intersections over unstructured meshes
- Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs
- A linear-time algorithm for finding Hamiltonian (s,t)-paths in even-sized rectangular grid graphs with a rectangular hole
- Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time
- Parallel construction of Hamiltonian paths for conforming tetrahedral meshes
- Existence and construction of Hamiltonian paths and cycles on conforming tetrahedral meshes
- Hamiltonian cycles in linear-convex supergrid graphs
- Hamiltonian paths in some classes of grid graphs
- Hamiltonian properties of honeycomb meshes
- The Hamiltonian properties of supergrid graphs
- Longest (s, t)-paths in L-shaped grid graphs
- Hamiltonian paths in L-shaped grid graphs
- The Hamiltonicity and Hamiltonian-connectivity of solid supergrid graphs
- 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids
- A linear-time algorithm for finding Hamiltonian cycles in rectangular grid graphs with two rectangular holes
- Directed hamiltonian packing in d-dimensional meshes and its application
- The longest path problem in odd-sized O-shaped grid graphs
- Hamiltonian (s, t)-paths in solid supergrid graphs
- The Hamiltonian path graph is connected for simple s,t paths in rectangular grid graphs
- The Hamiltonian (s, t)-path problem in odd-sized H-alphabet grid graphs
- Hamiltonicity of rectangular grid graphs (meshes) with an L-shaped hole
- A linear-time algorithm for the longest path problem in rectangular grid graphs
- A successful algorithm for solving directed Hamiltonian path problems
- Fault-tolerant Hamiltonicity in a class of faulty meshes
This page was built for publication: An efficient algorithm for constructing Hamiltonian paths in meshes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1614877)
