Pages that link to "Item:Q494797"
From MaRDI portal
The following pages link to Space-time trade-offs for stack-based algorithms (Q494797):
Displayed 14 items.
- Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\) (Q906384) (← links)
- Time-space trade-offs for triangulations and Voronoi diagrams (Q1615777) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← links)
- A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon (Q2272372) (← links)
- Space efficient linear time algorithms for BFS, DFS and applications (Q2322695) (← links)
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← 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-Off for Finding the k-Visibility Region of a Point in a Polygon (Q2980918) (← 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)
- (Q5136282) (← links)
- (Q5140731) (← links)