Publication:4326201
From MaRDI portal
zbMath0816.05040MaRDI QIDQ4326201
Lambert Meertens, Danny Krizanc, Evangelos Kranakis
Publication date: 13 July 1995
algorithm; upper bounds; lower bounds; Hamiltonian path; higher dimensional grids; rectilinear Hamiltonian tours
05C38: Paths and cycles
05C85: Graph algorithms (graph-theoretic aspects)
05C45: Eulerian and Hamiltonian graphs
Related Items
Traversing a set of points with a minimum number of turns, Distributed transformations of Hamiltonian shapes based on line moves, Improved lower bounds for the link length of rectilinear spanning paths in grids, Taming the knight's tour: minimizing turns and crossings, Covering paths for planar point sets, Optimal Insertion of a Segment Highway in a City Metric