Pages that link to "Item:Q390167"
From MaRDI portal
The following pages link to Reprint of: Memory-constrained algorithms for simple polygons (Q390167):
Displaying 8 items.
- Space-efficient biconnected components and recognition of outerplanar graphs (Q666673) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← 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)
- Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS (Q2420652) (← links)
- Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays. (Q5005169) (← links)
- A Framework for In-place Graph Algorithms (Q5009570) (← links)
- Optimal In-place Algorithms for Basic Graph Problems (Q5041185) (← links)
