Asymptotic properties of Euclidean shortest-path trees in random geometric graphs (Q900933)
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 6523866
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Asymptotic properties of Euclidean shortest-path trees in random geometric graphs |
scientific article; zbMATH DE number 6523866 |
Statements
Asymptotic properties of Euclidean shortest-path trees in random geometric graphs (English)
0 references
23 December 2015
0 references
random geometric graph
0 references
Cox process
0 references
Voronoi tessellation
0 references
shortest-path tree
0 references
backbone length
0 references
total length
0 references
0 references
0 references
0 references
0.8270813226699829
0 references
0.804146945476532
0 references
0.770649790763855
0 references
0.7564147710800171
0 references
0.7474481463432312
0 references
