A fast algorithm for connectivity graph approximation using modified Manhattan distance in dynamic networks (Q945254)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast algorithm for connectivity graph approximation using modified Manhattan distance in dynamic networks |
scientific article; zbMATH DE number 5342824
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for connectivity graph approximation using modified Manhattan distance in dynamic networks |
scientific article; zbMATH DE number 5342824 |
Statements
A fast algorithm for connectivity graph approximation using modified Manhattan distance in dynamic networks (English)
0 references
12 September 2008
0 references
connectivity graph approximation
0 references
ad hoc networks
0 references
modified Manhattan measure
0 references
Monte Carlo simulation
0 references
mean degree distribution
0 references
0.8706559
0 references
0.8620155
0 references
0.85959524
0 references
0.85731196
0 references
0.8567972
0 references
0.85624754
0 references
0.8540135
0 references
