Pages that link to "Item:Q1093374"
From MaRDI portal
The following pages link to The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric (Q1093374):
Displaying 10 items.
- On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces (Q757098) (← links)
- On the symmetric angle-restricted nearest neighbor problem (Q834915) (← links)
- Survivable minimum bottleneck networks (Q904084) (← links)
- On the angle restricted nearest neighbor problem (Q910232) (← links)
- A divide-and-conquer algorithm for constructing relative neighborhood graph (Q911282) (← links)
- A linear expected-time algorithm for computing planar relative neighbourhood graphs (Q1108002) (← links)
- Relative neighborhood graphs in three dimensions (Q1200909) (← links)
- Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors (Q1343464) (← links)
- A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs (Q4557732) (← links)
- DISTRIBUTED SPANNERS WITH BOUNDED DEGREE FOR WIRELESS AD HOC NETWORKS (Q5696901) (← links)
