The following pages link to (Q3140432):
Displaying 25 items.
- A fast minimum spanning tree algorithm based on \(K\)-means (Q527132) (← links)
- Geometric spanners for weighted point sets (Q634687) (← links)
- Compatible connectivity augmentation of planar disconnected graphs (Q894688) (← links)
- I/O-efficient algorithms for computing planar geometric spanners (Q929749) (← links)
- Well-separated pair decomposition in linear time? (Q963421) (← links)
- Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies (Q988687) (← links)
- Region-fault tolerant geometric spanners (Q1016540) (← links)
- (Weakly) self-approaching geometric graphs and spanners (Q1631774) (← links)
- Computing depth orders for fat objects and related problems (Q1917032) (← links)
- On the power of the semi-separated pair decomposition (Q1947974) (← links)
- Local routing in sparse and lightweight geometric graphs (Q2134745) (← links)
- Sparse fault-tolerant spanners for doubling metrics with bounded hop-diameter or degree (Q2258072) (← links)
- Average stretch factor: how low does it go? (Q2340408) (← links)
- Matching point sets with respect to the earth mover's distance (Q2462736) (← links)
- Deformable spanners and applications (Q2507157) (← links)
- New Doubling Spanners: Better and Simpler (Q2954370) (← links)
- On the Power of the Semi-Separated Pair Decomposition (Q3183436) (← links)
- On Locality-Sensitive Orderings and Their Applications (Q3304732) (← links)
- A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs (Q4557732) (← links)
- Testing Euclidean Spanners (Q4933382) (← links)
- Selection in monotone matrices and computing k th nearest neighbors (Q5056162) (← links)
- On Locality-Sensitive Orderings and Their Applications (Q5090394) (← links)
- Spanners of Complete k-Partite Geometric Graphs (Q5458526) (← links)
- Lower bounds for computing geometric spanners and approximate shortest paths (Q5936458) (← links)
- Online Spanners in Metric Spaces (Q6195959) (← links)
