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

DOI10.1016/S0020-0190(98)00178-1zbMATH Open1339.68203OpenAlexW2089062774MaRDI QIDQ293479FDOQ293479

Authors: 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

Recommendations

• scientific article; zbMATH DE number 734472
• Settling the bound on the rectilinear link radius of a simple rectilinear polygon
• Traversing a set of points with a minimum number of turns
• Traversing a set of points with a minimum number of turns
• Improved parameterized algorithms for minimum link-length rectilinear spanning path problem

zbMATH Keywords

Hamiltonian pathlink lengthmultidimensional grids

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)

Cited In (9)

• Improved FPT Algorithms for Rectilinear k-Links Spanning Path
• Title not available (Why is that?)
• COVERING A SET OF POINTS WITH A MINIMUM NUMBER OF TURNS
• An improved linear edge bound for graph linkages
• Covering paths for planar point sets
• On Covering Points with Minimum Turns
• Improved parameterized algorithms for minimum link-length rectilinear spanning path problem
• Traversing a set of points with a minimum number of turns
• Taming the knight's tour: minimizing turns and crossings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293479)