The following pages link to (Q2968076):
Displaying 18 items.
- Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
- Computing a visibility polygon using few variables (Q396475) (← links)
- Prune-and-search with limited workspace (Q473192) (← links)
- Space-time trade-offs for stack-based algorithms (Q494797) (← links)
- Space-efficient biconnected components and recognition of outerplanar graphs (Q666673) (← links)
- Time-space trade-offs for triangulations and Voronoi diagrams (Q1615777) (← links)
- Constant work-space algorithms for facility location problems (Q2192101) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← links)
- Space efficient linear time algorithms for BFS, DFS and applications (Q2322695) (← links)
- Rectilinear path problems in restricted memory setup (Q2357163) (← 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)
- Improved Space Efficient Algorithms for BFS, DFS and Applications (Q2817855) (← links)
- Time-Space Trade-offs for Triangulations and Voronoi Diagrams (Q3449845) (← links)
- A Time-Space Trade-off for the Shortest Path Tree in a Simple Polygon (Q4640339) (← links)
- A Framework for In-place Graph Algorithms (Q5009570) (← links)
- Optimal In-place Algorithms for Basic Graph Problems (Q5041185) (← links)
- Experimental study of compressed stack algorithms in limited memory environments (Q5140731) (← links)
