Pages that link to "Item:Q929746"
From MaRDI portal
The following pages link to Sparse geometric graphs with small dilation (Q929746):
Displaying 20 items.
- Sparse hop spanners for unit disk graphs (Q824328) (← links)
- Computing a minimum-dilation spanning tree is NP-hard (Q945943) (← links)
- Light orthogonal networks with constant geometric dilation (Q1013080) (← links)
- Low-interference networks in metric spaces of bounded doubling dimension (Q1944217) (← links)
- A spanner for the day after (Q2223618) (← links)
- Most finite point sets in the plane have dilation \(>1\) (Q2256585) (← links)
- Shortcut sets for the locus of plane Euclidean networks (Q2335528) (← links)
- Lattice Spanners of Low Degree (Q2795942) (← links)
- Lattice spanners of low degree (Q2821117) (← links)
- Computing Minimum Dilation Spanning Trees in Geometric Graphs (Q3196394) (← links)
- Geometric Spanner of Objects under L 1 Distance (Q3511351) (← links)
- COMPUTING GEOMETRIC MINIMUM-DILATION GRAPHS IS NP-HARD (Q3562852) (← links)
- (Q5088946) (← links)
- Geometric Spanner of Segments (Q5387747) (← links)
- Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones (Q5502177) (← links)
- Lower Bounds on the Dilation of Plane Spanners (Q5890540) (← links)
- Lower Bounds on the Dilation of Plane Spanners (Q5890968) (← links)
- (Q6065466) (← links)
- Vertex Fault-Tolerant Geometric Spanners for Weighted Points (Q6173263) (← links)
- Vertex fault-tolerant spanners for weighted points in polygonal domains (Q6174157) (← links)
