Pages that link to "Item:Q2865044"
From MaRDI portal
The following pages link to Constant-work-space algorithms for shortest paths in trees and simple polygons (Q2865044):
Displaying 8 items.
- Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
- Space-time trade-offs for stack-based algorithms (Q494797) (← links)
- Memory efficient algorithms for cactus graphs and block graphs (Q528335) (← links)
- Constant work-space algorithms for facility location problems (Q2192101) (← links)
- Memory-constrained algorithms for simple polygons (Q2391542) (← links)
- A new balanced subdivision of a simple polygon for time-space trade-off algorithms (Q2415364) (← links)
- Polylog-time and near-linear work approximation scheme for undirected shortest paths (Q4406310) (← links)
- A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon (Q4640339) (← links)