DIALM 2008 Workshop on Discrete Algothrithms and Methods for MOBILE Computing and Communications
 |  |
Wall of Fame | Most Viewed DIALM-2008 Paper
DIALM
2008
ACM
13 years 6 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website.
Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 179 | ||
| 2 | | 168 | ||
| 3 | | 140 | ||
| 4 | | 139 | ||
| 5 | | 135 | ||
| 6 | | 96 |