Improved lower bounds for the link length of rectilinear spanning paths in grids

DOI10.1016/S0020-0190(98)00178-1zbMath1339.68203OpenAlexW2089062774MaRDI QIDQ293479

Michael J. Collins, Bernard M. E. Moret

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001781?np=y

zbMATH Keywords

Hamiltonian pathlink lengthmultidimensional grids

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Related Items (5)

COVERING A SET OF POINTS WITH A MINIMUM NUMBER OF TURNS ⋮ Traversing a set of points with a minimum number of turns ⋮ Covering paths for planar point sets ⋮ On Covering Points with Minimum Turns ⋮ Taming the knight's tour: minimizing turns and crossings

Cites Work

• Unnamed Item

This page was built for publication: Improved lower bounds for the link length of rectilinear spanning paths in grids