The coverage holes of the largest component of random geometric graph (Q277050)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6577445
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The coverage holes of the largest component of random geometric graph |
scientific article; zbMATH DE number 6577445 |
Statements
The coverage holes of the largest component of random geometric graph (English)
0 references
4 May 2016
0 references
random geometric graph
0 references
continuum percolation
0 references
wireless sensor networks
0 references
coverage
0 references
0 references
0 references
0.8242437243461609
0 references
0.7813886404037476
0 references
0.7790610194206238
0 references
0.7711637616157532
0 references
0.7661845088005066
0 references
