An efficient algorithm for constructing Hamiltonian paths in meshes

DOI10.1016/S0167-8191(02)00135-7zbMath0999.68253MaRDI QIDQ1614877

Shao Dong Chen, Hong Shen, Rodney W. Topor

Publication date: 9 September 2002

Published in: Parallel Computing (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian pathsefficient linear-time sequential algorithm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (15)

Hamiltonian cycles in linear-convex supergrid graphs ⋮ Fault-tolerant Hamiltonicity in a class of faulty meshes ⋮ 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 ⋮ 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 ⋮ Hamiltonian paths in some classes of grid graphs ⋮ Longest (s, t)-paths in L-shaped grid graphs ⋮ Hamiltonian properties of honeycomb meshes ⋮ The Hamiltonian properties of supergrid graphs ⋮ The Hamiltonian connectivity of rectangular supergrid graphs ⋮ Hamiltonian paths in \(L\)-shaped grid graphs ⋮ Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs ⋮ A linear-time algorithm for the longest path problem in rectangular grid graphs

This page was built for publication: An efficient algorithm for constructing Hamiltonian paths in meshes