Pages that link to "Item:Q293479"
From MaRDI portal
The following pages link to Improved lower bounds for the link length of rectilinear spanning paths in grids (Q293479):
Displaying 8 items.
- Improved parameterized algorithms for minimum link-length rectilinear spanning path problem (Q477189) (← links)
- An improved linear edge bound for graph linkages (Q1767622) (← links)
- Taming the knight's tour: minimizing turns and crossings (Q2067620) (← links)
- Covering paths for planar point sets (Q2250054) (← links)
- Improved FPT Algorithms for Rectilinear k-Links Spanning Path (Q2898068) (← links)
- COVERING A SET OF POINTS WITH A MINIMUM NUMBER OF TURNS (Q4818599) (← links)
- On Covering Points with Minimum Turns (Q5892218) (← links)
- Traversing a set of points with a minimum number of turns (Q5901749) (← links)