The following pages link to Geometric Spanner Networks (Q3445775):
Displaying 46 items.
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
- Temporal Cliques Admit Sparse Spanners (Q5092337) (← links)
- (Q5092418) (← links)
- Near Isometric Terminal Embeddings for Doubling Metrics (Q5115804) (← links)
- Odd Yao-Yao Graphs are Not Spanners (Q5115817) (← links)
- Faster DBScan and HDBScan in Low-Dimensional Euclidean Spaces (Q5136243) (← links)
- Spanning Properties of Yao and 𝜃-Graphs in the Presence of Constraints (Q5197491) (← links)
- Geodesic Spanners for Points on a Polyhedral Terrain (Q5206937) (← links)
- Faster DBSCAN and HDBSCAN in Low-Dimensional Euclidean Spaces (Q5234039) (← links)
- (Q5240127) (← links)
- EMBEDDING POINT SETS INTO PLANE GRAPHS OF SMALL DILATION (Q5297793) (← links)
- A GEOMETRIC SPANNER OF SEGMENTS (Q5305063) (← links)
- DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES (Q5305064) (← links)
- The Stretch - Length Tradeoff in Geometric Networks: Average Case and Worst Case Study (Q5360331) (← links)
- Construction and Local Routing for Angle-Monotone Graphs (Q5377357) (← links)
- Dilation-Optimal Edge Deletion in Polygonal Cycles (Q5387748) (← links)
- Spanners of Complete k-Partite Geometric Graphs (Q5458526) (← links)
- Light Euclidean Spanners with Steiner Points (Q5874539) (← links)
- (Q5875486) (← links)
- The Minimum Moving Spanning Tree Problem (Q5886031) (← links)
- Lower Bounds on the Dilation of Plane Spanners (Q5890540) (← links)
- Lower Bounds on the Dilation of Plane Spanners (Q5890968) (← links)
- The Price of Order (Q5892116) (← links)
- The Price of Order (Q5892451) (← links)
- Small hop-diameter sparse spanners for doubling metrics (Q5901493) (← links)
- A simple and efficient kinetic spanner (Q5902230) (← links)
- Improved stretch factor of Delaunay triangulations of points in convex position (Q5918555) (← links)
- Distributed algorithms for ultrasparse spanners and linear size skeletons (Q5919900) (← links)
- Minimum weight Euclidean \((1+\varepsilon)\)-spanners (Q6039440) (← links)
- Spanners in randomly weighted graphs: Euclidean case (Q6047967) (← links)
- Improved routing on the Delaunay triangulation (Q6050212) (← links)
- Shortest-Path Queries in Geometric Networks (Q6065461) (← links)
- (Q6065466) (← links)
- On algorithmic complexity of imprecise spanners (Q6071451) (← links)
- Reliable Spanners for Metric Spaces (Q6075742) (← links)
- Social distancing network creation (Q6107894) (← links)
- Generalized sweeping line spanners (Q6113871) (← links)
- (Q6124757) (← links)
- (Q6124759) (← links)
- Geometric spanning trees minimizing the Wiener index (Q6138982) (← links)
- Local routing algorithms on Euclidean spanners with small diameter (Q6164009) (← links)
- Vertex Fault-Tolerant Geometric Spanners for Weighted Points (Q6173263) (← links)
- Vertex fault-tolerant spanners for weighted points in polygonal domains (Q6174157) (← links)
- Online Spanners in Metric Spaces (Q6195959) (← links)
- Generalized sweeping line spanners (Q6201325) (← links)
- Minimum weight Euclidean \((1+\varepsilon)\)-spanners (Q6201907) (← links)