Pages that link to "Item:Q3986395"
From MaRDI portal
The following pages link to CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS (Q3986395):
Displaying 14 items.
- Sparse geometric graphs with small dilation (Q929746) (← links)
- I/O-efficient algorithms for computing planar geometric spanners (Q929749) (← links)
- Computing a minimum-dilation spanning tree is NP-hard (Q945943) (← links)
- Region-fault tolerant geometric spanners (Q1016540) (← links)
- Euclidean spanner graphs with degree four (Q1336638) (← links)
- Average stretch factor: how low does it go? (Q2340408) (← links)
- Efficient construction of a bounded-degree spanner with low weight (Q2365175) (← links)
- An Optimal Dynamic Spanner for Doubling Metric Spaces (Q3541109) (← links)
- ON SPANNERS OF GEOMETRIC GRAPHS (Q3620618) (← links)
- MIXED SPANNING TREES IN THEORY AND PRACTICE (Q4949992) (← links)
- Spanners of Complete k-Partite Geometric Graphs (Q5458526) (← links)
- Small hop-diameter sparse spanners for doubling metrics (Q5901493) (← links)
- Fully dynamic geometric spanners (Q5920251) (← links)
- Lower bounds for computing geometric spanners and approximate shortest paths (Q5936458) (← links)
