Pages that link to "Item:Q1106021"
From MaRDI portal
The following pages link to The expected size of some graphs in computational geometry (Q1106021):
Displaying 19 items.
- Distribution-sensitive construction of the greedy spanner (Q527422) (← links)
- On the number of higher order Delaunay triangulations (Q551184) (← links)
- Connected spatial networks over random points and a route-length statistic (Q906528) (← links)
- Coloring certain proximity graphs (Q917569) (← links)
- The \(\gamma\)-neighborhood graph (Q1194312) (← links)
- The expected number of \(k\)-faces of a Voronoi diagram (Q1309732) (← links)
- On nearest-neighbor graphs (Q1355198) (← links)
- Intersections with random geometric objects (Q1392845) (← links)
- Bounds to the normal for proximity region graphs (Q1743341) (← links)
- Weak laws of large numbers in geometric probability (Q1872342) (← links)
- The expected size of the sphere-of-influence graph (Q1903638) (← links)
- Local solutions for global problems in wireless networks (Q2466005) (← links)
- On the expected maximum degree of Gabriel and Yao graphs (Q3558941) (← links)
- On the variance of the random sphere of influence graph (Q4238439) (← links)
- PROXIMITY GRAPHS: E, δ, Δ, χ AND ω (Q5300005) (← links)
- GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING (Q5311630) (← links)
- Normal approximation in total variation for statistics in geometric probability (Q6119930) (← links)
- Convergence rate for geometric statistics of point processes having fast decay of dependence (Q6165985) (← links)
- On Azadkia-Chatterjee's conditional dependence coefficient (Q6201829) (← links)
