The following pages link to (Q4265786):
Displayed 12 items.
- Hamilton cycles in random geometric graphs (Q549867) (← links)
- Thresholding random geometric graph properties motivated by ad hoc sensor networks (Q988583) (← links)
- Maximum scan statistics and channel assignment problems in homogeneous wireless networks (Q1019740) (← links)
- Continuum percolation of wireless ad hoc communication networks (Q1394695) (← links)
- The connectivity of a graph on uniform points on [0,\,1]\(^{d}\). (Q1871346) (← links)
- Topological properties of random wireless networks (Q2371220) (← links)
- On the fundamental limits of topology control in ad hoc networks (Q2471707) (← links)
- On the typical case complexity of graph optimization (Q2581548) (← links)
- On covering by translates of a set (Q3068760) (← links)
- Disjoint Hamilton cycles in the random geometric graph (Q3106267) (← links)
- Percolation in Voronoi tilings (Q4680411) (← links)
- Theoretical Aspects of Graph Models for MANETs (Q5391114) (← links)