Pages that link to "Item:Q2921769"
From MaRDI portal
The following pages link to The bin-covering technique for thresholding random geometric graph properties (Q2921769):
Displaying 17 items.
- The coverage holes of the largest component of random geometric graph (Q277050) (← links)
- Size of the giant component in a random geometric graph (Q376695) (← links)
- One-dimensional geometric random graphs with nonvanishing densities. II: A very strong zero-one law for connectivity (Q383292) (← links)
- Initializing sensor networks of non-uniform density in the weak sensor model (Q494934) (← links)
- Thresholding random geometric graph properties motivated by ad hoc sensor networks (Q988583) (← links)
- Energy efficient randomised communication in unknown AdHoc networks (Q1029326) (← links)
- Stretch and diameter in random geometric graphs (Q1702131) (← links)
- Detecting a botnet in a network (Q2078962) (← links)
- On the cover time and mixing time of random geometric graphs (Q2373731) (← links)
- Fast message dissemination in random geometric networks (Q2375822) (← links)
- Broadcasting in UDG radio networks with unknown topology (Q2377263) (← links)
- Monotone properties of random geometric graphs have sharp thresholds (Q2496499) (← links)
- Constrained minimum passage time in random geometric graphs (Q2659771) (← links)
- On Radio Broadcasting in Random Geometric Graphs (Q3540232) (← links)
- Automata, Languages and Programming (Q5716818) (← links)
- (Q5875512) (← links)
- Reconstruction of random geometric graphs: breaking the \(\varOmega (r)\) distortion barrier (Q6612518) (← links)