Pages that link to "Item:Q1814131"
From MaRDI portal
The following pages link to A sparse graph almost as good as the complete graph on points in \(k\) dimensions (Q1814131):
Displaying 23 items.
- Spanners of de Bruijn and Kautz graphs (Q287077) (← links)
- On bounded leg shortest paths problems (Q633848) (← links)
- 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)
- Well-separated pair decomposition in linear time? (Q963421) (← links)
- Region-fault tolerant geometric spanners (Q1016540) (← links)
- Approximating Euclidean distances by small degree graphs (Q1317879) (← links)
- Euclidean spanner graphs with degree four (Q1336638) (← links)
- Balancing minimum spanning trees and shortest-path trees (Q1899219) (← links)
- Fractal dimension and lower bounds for geometric problems (Q2039303) (← links)
- Light spanners for high dimensional norms via stochastic decompositions (Q2088589) (← 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)
- (Q5009588) (← links)
- (Q5116530) (← 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)
