The following pages link to ON SPANNERS OF GEOMETRIC GRAPHS (Q3620618):
Displaying 13 items.
- On plane geometric spanners: a survey and open problems (Q359741) (← links)
- Minimum weight Euclidean \(t\)-spanner is NP-hard (Q396666) (← links)
- Geometric spanners with applications in wireless networks (Q868107) (← links)
- Improved NP-hardness results for the minimum \(t\)-spanner problem on bounded-degree graphs (Q2682929) (← links)
- On Pairwise Spanners (Q2957885) (← links)
- Spanners for geometric intersection graphs with applications (Q2968085) (← links)
- SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES (Q3459364) (← links)
- COMPUTING GEOMETRIC MINIMUM-DILATION GRAPHS IS NP-HARD (Q3562852) (← links)
- Spanners for Geometric Intersection Graphs (Q3603536) (← links)
- (Q4437269) (← links)
- Geometric Spanners for Points Inside a Polygonal Domain (Q5368687) (← links)
- Spanners of Complete k-Partite Geometric Graphs (Q5458526) (← links)
- Spanning triangulations in graphs (Q5462389) (← links)