Pages that link to "Item:Q3132885"
From MaRDI portal
The following pages link to On the complexity of minimum-link path problems (Q3132885):
Displaying 8 items.
- Structured discrete shape approximation: theoretical complexity and practical algorithm (Q824342) (← links)
- The minimum reload \(s-t\) path, trail and walk problems (Q987690) (← links)
- On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time (Q1286472) (← links)
- Minimum-link paths revisited (Q2450201) (← links)
- (Q2978407) (← links)
- The Minimum Reload s-t Path/Trail/Walk Problems (Q3599109) (← links)
- Link-Length Minimization in Networks (Q5378793) (← links)
- Global optimization: On pathlengths in min-max graphs (Q5928206) (← links)