The following pages link to Fully dynamic geometric spanners (Q5920251):
Displaying 12 items.
- Dynamic algorithms for geometric spanners of small diameter: Randomized solutions (Q1807649) (← links)
- Dynamic well-spaced point sets (Q1947994) (← links)
- Incremental algorithm for maintaining a DFS tree for undirected graphs (Q2408922) (← links)
- Robust geometric spanners (Q2862209) (← links)
- On Locality-Sensitive Orderings and Their Applications (Q3304732) (← links)
- The Greedy Spanner Is Existentially Optimal (Q4960447) (← links)
- On Locality-Sensitive Orderings and Their Applications (Q5090394) (← links)
- (Q5092428) (← links)
- Geodesic Spanners for Points on a Polyhedral Terrain (Q5206937) (← links)
- Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier (Q5232328) (← links)
- Online Spanners in Metric Spaces (Q6195959) (← links)
- Minimum weight Euclidean \((1+\varepsilon)\)-spanners (Q6201907) (← links)